Succinct Representation of Labeled Graphs
Authors:
- 16 December 2007
- book chapter
- Published by Springer Nature
- p. 316-328
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Balanced parentheses strike backACM Transactions on Algorithms, 2008
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured DocumentsLecture Notes in Computer Science, 2006
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Succinct Representation of Triangulations with a BoundaryLecture Notes in Computer Science, 2005
- Succinct Representation of Balanced Parentheses and Static TreesSIAM Journal on Computing, 2001
- Face fixer2000
- Compact encodings of planar graphs via canonical orderings and multiple parentheses1998
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI DesignSIAM Journal on Algebraic Discrete Methods, 1987
- The book thickness of a graphJournal of Combinatorial Theory, Series B, 1979
- Sorting Using Networks of Queues and StacksJournal of the ACM, 1972