Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions

DOI10.1007/978-3-540-73545-8_40zbMATH Open1206.05097OpenAlexW1872297053MaRDI QIDQ3608865FDOQ3608865

Charis Papadopoulos, Pinar Heggernes

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_40

Recommendations

• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
• Minimal split completions
• scientific article
• Characterizing and Computing Minimal Cograph Completions
• Characterizing and computing minimal cograph completions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Cited In (6)

• Characterizing and computing minimal cograph completions
• Characterizing and Computing Minimal Cograph Completions
• Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
• Graph modification problem for some classes of graphs
• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
• Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs

This page was built for publication: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions

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