BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION

DOI10.1142/S179383091360001XzbMath1271.05051MaRDI QIDQ2846474

Takeaki Uno, Ryuhei Uehara, Shin-ichi Nakano

Publication date: 5 September 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

countingseries-parallel graphcographcompact representationencoding/decoding schemeunordered reduce tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A simple linear time algorithm for cograph recognition
• Short encodings of planar graphs and maps
• Succinct Representation of Balanced Parentheses and Static Trees
• Succinct ordinal trees with level-ancestor queries
• A Linear Recognition Algorithm for Cographs
• Graph Classes: A Survey
• Orderly Spanning Trees with Applications

This page was built for publication: BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION