Sciweavers

126 search results - page 1 / 26
» The Homogeneous Set Sandwich Problem
Sort
View
IPL
2006
83views more  IPL 2006»
13 years 5 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
13 years 10 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
IPL
1998
48views more  IPL 1998»
13 years 5 months ago
The Homogeneous Set Sandwich Problem
Márcia R. Cerioli, Hazel Everett, Celina M....
ENDM
2008
93views more  ENDM 2008»
13 years 5 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
ENDM
2000
60views more  ENDM 2000»
13 years 5 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...