Modification problems toward proper (Helly) circular-arc graphs
From MaRDI portal
Publication:6647753
DOI10.1016/j.ic.2024.105211MaRDI QIDQ6647753
Jianxin Wang, Yixin Cao, Hanchun Yuan
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- Fundamentals of parameterized complexity
- Unit interval editing is fixed-parameter tractable
- Clique graphs of time graphs
- Claw-free graphs. III: Circular interval graphs
- The node-deletion problem for hereditary properties is NP-complete
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Normal Helly circular-arc graphs and its subclasses
- Proper interval vertex deletion
- Vertex deletion into bipartite permutation graphs
- Structure theorems for some circular-arc graphs
- Proper Helly Circular-Arc Graphs
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Computing the Minimum Fill-In is NP-Complete
- Algorithms on circular-arc graphs
- Linear Recognition of Almost Interval Graphs
- Interval bigraphs and circular arc graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Interval Deletion Is Fixed-Parameter Tractable
- Transitiv orientierbare Graphen
- A survey of parameterized algorithms and the complexity of edge modification
This page was built for publication: Modification problems toward proper (Helly) circular-arc graphs
