Short encodings of planar graphs and maps
Authors:
- Kenneth KeelerKKKenneth Keeler
- Jeffery WestbrookJWJeffery Westbrook
Open Access
- 1 April 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 58 (3) , 239-252
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Succinct representation of general unlabeled graphsDiscrete Applied Mathematics, 1990
- On the succinct representation of graphsDiscrete Applied Mathematics, 1984
- Representation of graphsActa Informatica, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A Census of Planar MapsCanadian Journal of Mathematics, 1963
- A Census of Planar TriangulationsCanadian Journal of Mathematics, 1962