Algorithms Solving the Matching Cut Problem
From MaRDI portal
Publication:2947027
DOI10.1007/978-3-319-18173-8_21zbMath1459.68159OpenAlexW1028792069MaRDI QIDQ2947027
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_21
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Exact exponential algorithms.
- On stable cutsets in claw-free graphs and planar graphs
- Matching cutsets in graphs of diameter 2
- Coloring graphs with stable cutsets
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Graph decomposition of slim graphs
- Stable set bonding in perfect graphs and parity graphs
- On stable cutsets in line graphs
- On stable cutsets in graphs
- A note on fragile graphs
- Which problems have strongly exponential complexity?
- Extremal graphs having no stable cutset
- Parametrized complexity theory.
- Recognizing decomposable graphs
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Networks immune to isolated line failures
- On the Complexity of Timetable and Multicommodity Flow Problems
- Finding a Minimum Circuit in a Graph
- Fragile graphs with small independent cuts
- Matching cutsets in graphs
- A Computing Procedure for Quantification Theory
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
This page was built for publication: Algorithms Solving the Matching Cut Problem
