Succinct Representation of Labeled Graphs

DOI10.1007/978-3-540-77120-3_29zbMath1193.05142OpenAlexW1592629156MaRDI QIDQ5387767

J. Ian Munro, Luca Castelli Aleardi, Jérémy Barbay, Meng He

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00712915/file/SuccinctLabeledGraphs_Algorithmica_Hal.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ On the succinct representation of equivalence classes ⋮ Succinct encoding of binary strings representing triangulations ⋮ Succinct representation of labeled graphs ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ I/O-efficient path traversal in succinct planar graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing trees of higher degree
• The book thickness of a graph
• Succinct Representation of Balanced Parentheses and Static Trees
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Balanced parentheses strike back
• Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
• Algorithms and Data Structures
• Sorting Using Networks of Queues and Stacks

This page was built for publication: Succinct Representation of Labeled Graphs