Minimal Interval Completion Through Graph Exploration

DOI10.1007/11940128_52MaRDI QIDQ5459146zbMATH OpenOpenAlexWikidataFDO

Authors Karol Suchan, Ioan Todinca

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_52

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Minimal interval completion through graph exploration
• Minimal proper interval completions
• Minimal Proper Interval Completions
• An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
• An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem

Cited in

(12)

• An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
• Characterizing and computing minimal cograph completions
• Algorithms – ESA 2005
• Minimal interval completion through graph exploration
• An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem
• Characterizing and Computing Minimal Cograph Completions
• Characterizing Minimal Interval Completions
• Minimal comparability completions of arbitrary graphs
• Minimal Proper Interval Completions
• An integer programming model for the minimum interval graph completion problem
• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
• An \(O(n^2)\) time algorithm for the minimal permutation completion problem

This page was built for publication: Minimal Interval Completion Through Graph Exploration

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