Sciweavers

332 search results - page 9 / 67
» Compositions of Graphs Revisited
Sort
View
ORL
2008
120views more  ORL 2008»
13 years 7 months ago
Composition of stable set polyhedra
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
Benjamin McClosky, Illya V. Hicks
ENDM
2000
60views more  ENDM 2000»
13 years 7 months ago
The graph sandwich problem for 1-join composition is NP-complete
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
Celina M. Herrera de Figueiredo, Sulamita Klein, K...
EDBTW
2010
Springer
14 years 2 months ago
Biochemical network matching and composition
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
Martin Hugh Goodfellow, John Wilson, Ela Hunt
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
CSL
2009
Springer
14 years 1 months ago
Automatic Structures of Bounded Degree Revisited
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
Dietrich Kuske, Markus Lohrey