691 search results - page 9 / 139 » Non-negative graph embedding |
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
SIGAL
1990
13 years 12 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
GD
2009
Springer
14 years 14 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
APPROX
2008
Springer
13 years 10 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...