5889 search results - page 240 / 1178 » Graph Layout Problems |
138
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
183
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
196
click to vote
CSL
2007
Springer
16 years 24 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
167
click to vote
AAAI
2006
15 years 8 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
200
click to vote
COCOON
2005
Springer
16 years 5 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...