6740 search results - page 410 / 1348 » An s -Hamiltonian Line Graph Problem |
195
click to vote
ARSCOM
2004
15 years 6 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
177
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
160
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
212
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
168
Voted
FLAIRS
2003
15 years 8 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...