Short encodings of planar graphs and maps
Discrete Applied Mathematics
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Graph classes: a survey
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Orderly Spanning Trees with Applications
SIAM Journal on Computing
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A compact encoding of plane triangulations with efficient query supports
Information Processing Letters
Efficient Alignments of Metabolic Networks with Bounded Treewidth
ICDMW '10 Proceedings of the 2010 IEEE International Conference on Data Mining Workshops
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
We give an efficient encoding and decoding scheme for computing a compact representation of a graph in one of unordered reduced trees, cographs, and series-parallel graphs. The unordered reduced trees are rooted trees in which (i) the ordering of children of each vertex does not matter, and (ii) no vertex has exactly one child. This is one of basic models frequently used in many areas. Our algorithm computes a bit string of length 2ℓ−1 for a given unordered reduced tree with ℓ≥1 leaves in O(ℓ) time, whereas a known folklore algorithm computes a bit string of length 2n−2 for an ordered tree with n vertices. Note that in an unordered reduced tree ℓ≤n2ℓ−2 for ℓ≥1. Moreover, the encoding and decoding can be done in linear time. Therefore, from the practical point of view, our representation is also useful to store a lot of unordered reduced trees efficiently. We also apply the scheme for computing a compact representation to cographs and series-parallel graphs. We show that each of cographs with n vertices has a compact representation in 2n−1 bits, and the number of cographs with n vertices is at most 22n−1. The resulting number is close to the number of cographs with n vertices obtained by the enumeration for small n that approximates Cdn/n3/2, where C=0.4126⋯ and d=3.5608⋯. Series-parallel graphs are well investigated in the context of the graphs of bounded treewidth. We give a method to represent a series-parallel graph with m edges in $\left\lceil2.5285m-2\right\rceil $ bits. Hence the number of series-parallel graphs with m edges is at most $2^{\left\lceil2.5285m-2\right\rceil }$. As far as the authors know, this is the first non-trivial result about the number of series-parallel graphs. The encoding and decoding of the cographs and series-parallel graphs also can be done in linear time.