6740 search results - page 170 / 1348 » An s -Hamiltonian Line Graph Problem |
GD
2006
Springer
14 years 2 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
FLAIRS
2008
13 years 11 months ago
2008
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
ENDM
2006
13 years 10 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...
ISAAC
2007
Springer
14 years 4 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...
WAOA
2007
Springer
14 years 4 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...