6740 search results - page 283 / 1348 » An s -Hamiltonian Line Graph Problem |
138
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
112
Voted
VIZSEC
2004
Springer
15 years 6 months ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
93
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
98
Voted
TALG
2008
15 years 29 days ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
98
Voted
WG
2007
Springer
15 years 7 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...