684 search results - page 3 / 137 » On embedding well-separable graphs |
RTCSA
1998
IEEE
15 years 4 months ago
1998
IEEE
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
JGT
2006
14 years 11 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
IPL
2010
14 years 10 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
108
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...