Succinct data structure for chordal graphs with bounded vertex leafage

DOI10.4230/LIPICS.SWAT.2024.4MaRDI QIDQ6891154zbMATH OpenFDO

Authors Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2024.4

zbMATH Keywords

chordal graphsleafagepath graphssuccinct data structurevertex leafage

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A recognition algorithm for the intersection graphs of paths in trees
• Algorithmic graph theory and perfect graphs
• An efficient representation of chordal graphs
• Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
• Counting labelled chordal graphs
• Fully functional static and dynamic succinct trees
• scientific article; zbMATH DE number 3404257 (Why is no real title available?)
• Intersection graphs of paths in a tree
• Introduction to algorithms.
• Rank/select operations on large alphabets
• Representation of graphs
• Space efficient linear time algorithms for BFS, DFS and applications
• Space-efficient basic graph algorithms
• Succinct data structure for path graphs
• Succinct data structures for chordal graphs
• Succinct encodings for families of interval graphs
• Succinct navigational oracles for families of intersection graphs on a circle
• Succinct representations of permutations and functions
• The leafage of a chordal graph
• The vertex leafage of chordal graphs

Cited in

(1)

• Succinct data structures for chordal graph with bounded leafage or vertex leafage

This page was built for publication: Succinct data structure for chordal graphs with bounded vertex leafage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891154)