Sciweavers

399 search results - page 2 / 80
» The sandwich line graph
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...
TCS
2008
13 years 5 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
SIAMCO
2000
74views more  SIAMCO 2000»
13 years 4 months ago
Nonsmooth Duality, Sandwich, and Squeeze Theorems
Given a nonlinear function h separating a convex and a concave function, we provide various conditions under which there exists an affine separating function whose graph is somewhe...
A. S. Lewis, R. E. Lucchetti
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
13 years 11 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw