5473 search results - page 141 / 1095 » On the graph isomorphism problem |
177
Voted
ENDM
2006
15 years 7 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
152
Voted
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
200
Voted
WAOA
2007
Springer
16 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
154
click to vote
APPML
2006
15 years 7 months ago
2006
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
169
click to vote
ALGORITHMICA
2006
15 years 7 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...