754 search results - page 44 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
APPROX
2006
Springer
14 years 8 days ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
COCOON
2010
Springer
14 years 1 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
COMPGEOM
1995
ACM
14 years 2 days ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...