2294 search results - page 202 / 459 » From Path Graphs to Directed Path Graphs |
84
Voted
ESA
1999
Springer
15 years 2 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
74
Voted
GD
2004
Springer
15 years 3 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
69
Voted
ISPD
1999
ACM
15 years 2 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
96
Voted
ALGOSENSORS
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
81
Voted
ACMACE
2008
ACM
15 years 7 days ago
2008
ACM
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...