An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
From MaRDI portal
Publication:2354311
DOI10.1007/s10878-014-9733-1zbMath1319.05127OpenAlexW2128467924MaRDI QIDQ2354311
Chao Xu, Jianxin Wang, Yunlong Liu, Jiong Guo, Jian'er Chen
Publication date: 10 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9733-1
Related Items (2)
A survey of parameterized algorithms and the complexity of edge modification ⋮ A Subexponential Parameterized Algorithm for Proper Interval Completion
Cites Work
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Polynomial kernels for 3-leaf power graph modification problems
- Complexity and parameterized algorithms for cograph editing
- Fixed-parameter tractability of graph modification problems for hereditary properties
- A general method to speed up fixed-parameter-tractable algorithms
- Automated generation of search tree algorithms for hard graphs modification problems
- Error compensation in leaf power problems
- Proper Interval Vertex Deletion
- A Novel Branching Strategy for Parameterized Graph Modification Problems
- Polynomial Kernels for Proper Interval Completion and Related Problems
- Improved Algorithms for Bicluster Editing
- Graph Classes: A Survey
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
This page was built for publication: An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
