Compact encodings of planar graphs via canonical orderings and multiple parentheses
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 118-129
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problemsTheoretical Computer Science, 1997
- Short encodings of planar graphs and mapsDiscrete Applied Mathematics, 1995
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar GraphsSIAM Journal on Discrete Mathematics, 1994
- Implicat Representation of GraphsSIAM Journal on Discrete Mathematics, 1992
- Succinct representation of general unlabeled graphsDiscrete Applied Mathematics, 1990
- How to draw a planar graph on a gridCombinatorica, 1990
- A note on succinct representations of graphsInformation and Control, 1986
- On the succinct representation of graphsDiscrete Applied Mathematics, 1984
- Succinct representations of graphsInformation and Control, 1983
- Representation of graphsActa Informatica, 1982