311 search results - page 7 / 63 » Graph Classes Between Parity and Distance-hereditary Graphs |
120
click to vote
ALGORITHMICA
2007
15 years 3 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
138
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
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...
118
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
237
click to vote
PLDI
2009
ACM
16 years 3 months ago
2009
ACM
Class sharing is a new language mechanism for building extensible software systems. Recent work has separately explored two different kinds of extensibility: first, family inherit...
130
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...