Short Encodings of Planar Graphs and Maps

Short Encodings of Planar Graphs and Maps (1993)

Cached

Download Links

[www.cs.yale.edu]

Other Repositories/Bibliography

DBLP

by Kenneth Keeler , Jeffery Westbrook

Venue:	Discrete Applied Mathematics
Citations:	39 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Short Encodings of Planar Graphs and Maps	user correction - Legacy Corrections
AUTHOR NAME	Kenneth Keeler	user correction - Legacy Corrections
AUTHOR AFFIL	y	user correction - Legacy Corrections
AUTHOR NAME	Jeffery Westbrook	user correction - Legacy Corrections
AUTHOR AFFIL	y	user correction - Legacy Corrections
ABSTRACT	We discuss space-efficient encoding schemes for planar graphs and maps. Our results improve on the constants of previous schemes and can be achieved with simple encoding algorithms. They are near-optimal in number of bits per edge. 1 Introduction In this paper we discuss space-efficient binary encoding schemes for several classes of unlabeled connected planar graphs and maps. In encoding a graph we must encode the incidences among vertexes and edges. By maps we understand topological equivalence classes of planar embeddings of planar graphs. In encoding a map we are required to encode the topology of the embedding i.e., incidences among faces, edges, and vertexes, as well as the graph. Each map is an embedding of a unique graph, but a given graph may have multiple embeddings. Hence maps must require more bits to encode than graphs in some average sense. There are a number of recent results on space-efficient encoding. A standard adjacency list encoding of an unlabeled graph G requires...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
VENUE	Discrete Applied Mathematics	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	239--252	INFERENCE
VOLUME	58	INFERENCE
CITATIONS	11 found	ParsCit 1.0