6740 search results - page 285 / 1348 » An s -Hamiltonian Line Graph Problem |
122
click to vote
CSLP
2004
Springer
15 years 7 months ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
103
Voted
ESA
2010
Springer
15 years 5 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.
144
click to vote
WG
2004
Springer
15 years 9 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...
165
click to vote
CSL
2007
Springer
15 years 10 months 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...
126
click to vote
AAAI
2006
15 years 5 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...