A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs

DOI10.1007/11917496_23zbMath1167.05337OpenAlexW1861154958MaRDI QIDQ3522962

Stavros D. Nikolopoulos, Charis Papadopoulos, Leonidas Palios

Publication date: 4 September 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11917496_23

zbMATH Keywords

recognitionmodular decompositionfully dynamic algorithms\(P_{4}\)-sparse graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs

This page was built for publication: A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs