169 search results - page 11 / 34 » On Graph Crossing Number and Edge Planarization |
101
click to vote
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
GD
2007
Springer
15 years 3 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
GD
2004
Springer
15 years 2 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
105
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...