90 search results - page 8 / 18 » Connecting face hitting sets in planar graphs |
JGT
2008
14 years 11 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
115
click to vote
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
104
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
92
Voted
MFCS
1998
Springer
15 years 3 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
132
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...