34 search results - page 2 / 7 » The firefighter problem for cubic graphs |
EJC
2010
13 years 5 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
ALGORITHMICA
2011
13 years 17 days ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
ALGORITHMICA
2006
13 years 5 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...