scientific article; zbMATH DE number 1305520

zbMath0929.68087MaRDI QIDQ4252412

Louis Ibarra

Publication date: 17 June 1999

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

zbMATH Keywords

dynamic algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints ⋮ A fully dynamic algorithm for modular decomposition and recognition of cographs. ⋮ Dynamic Distance Hereditary Graphs Using Split Decomposition ⋮ Fully dynamic recognition algorithm and certificate for directed cographs ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Dynamically maintaining split graphs

This page was built for publication: