scientific article; zbMATH DE number 7561421

DOI10.4230/LIPIcs.ISAAC.2018.67MaRDI QIDQ5091062

J. Ian Munro, Kaiyu Wu

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chordal graphsuccinct data structure

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (8)

Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Succinct encodings for families of interval graphs ⋮ Succinct permutation graphs ⋮ Succinct data structure for path graphs ⋮ Unnamed Item ⋮ Frameworks for designing in-place graph algorithms ⋮ Succinct navigational oracles for families of intersection graphs on a circle ⋮ Succinct representation for (non)deterministic finite automata

Cites Work

• Unnamed Item
• Succinct encoding of arbitrary graphs
• Compact navigation and distance oracles for graphs with small treewidth
• Fast set intersection and two-patterns matching
• Counting labelled chordal graphs
• Maintaining chordal graphs dynamically: improved upper and lower bounds
• A characterisation of rigid circuit graphs
• Minimum \(k\)-path vertex cover
• Triangulated graphs and the elimination process
• Fully Functional Static and Dynamic Succinct Trees
• Degrees of acyclicity for hypergraphs and relational database schemes
• Representations of chordal graphs as subtrees of a tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Fully dynamic algorithms for chordal graphs and split graphs
• Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
• Programming Languages and Systems

This page was built for publication: