754 search results - page 23 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
132
Voted
DAM
2011
14 years 10 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
118
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
139
click to vote
DAM
2010
15 years 3 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
141
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
143
Voted
STOC
1990
ACM
15 years 7 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...