57 search results - page 1 / 12 » Directed graphs and rectangular layouts |
APVIS
2007
13 years 6 months ago
2007
CORR
2006
Springer
13 years 4 months ago
2006
Springer
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
ISCC
2006
IEEE
13 years 10 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
CORR
2012
Springer
12 years 13 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...