57 search results - page 8 / 12 » Inapproximability for planar embedding problems |
113
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
127
Voted
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
73
Voted
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
113
click to vote
CCCG
2009
15 years 22 days ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
109
Voted
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...