Minimum Fill-in on Circle and Circular-Arc Graphs

DOI10.1006/jagm.1998.0936zbMath0912.68156OpenAlexW1964653177WikidataQ56503309 ScholiaQ56503309MaRDI QIDQ4209266

No author found.

Publication date: 24 November 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0936

zbMATH Keywords

circular-arc graphscircle graphsMINIMUM FILL-IN problem

Mathematics Subject Classification ID

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

Related Items (16)

On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Finding a maximum minimal separator: graph classes and fixed-parameter tractability ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ Pathwidth of Circular-Arc Graphs ⋮ A revisit of the scheme for computing treewidth and minimum fill-in ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs ⋮ Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques ⋮ Characterizing and computing minimal cograph completions ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ On \(H\)-topological intersection graphs ⋮ Unnamed Item ⋮ On the maximum weight minimal separator ⋮ Listing all potential maximal cliques of a graph

This page was built for publication: Minimum Fill-in on Circle and Circular-Arc Graphs