Sciweavers

1633 search results - page 17 / 327
» Planar Map Graphs
Sort
View
FSTTCS
2000
Springer
13 years 11 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
13 years 7 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
14 years 1 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
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 ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
LATIN
1995
Springer
13 years 11 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
ALGORITHMICA
2008
142views more  ALGORITHMICA 2008»
13 years 7 months ago
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
Richard Cole, Lukasz Kowalik