754 search results - page 17 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
CONSTRAINTS
2007
13 years 8 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
IPCO
2007
13 years 10 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
FUIN
2006
13 years 8 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...