scientific article; zbMATH DE number 7378605

DOI10.4230/LIPIcs.IPEC.2018.19MaRDI QIDQ5009482

Christian Komusiewicz, Dieter Kratsch, Bang le van

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmdecomposable graphmatching cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Related Items (2)

13th International Symposium on Parameterized and Exact Computation (IPEC 2018) ⋮ Finding perfect matching cuts faster

Cites Work

• Unnamed Item
• Unnamed Item
• A fast branching algorithm for cluster vertex deletion
• Exact exponential algorithms.
• Algorithms solving the matching cut problem
• Matching cutsets in graphs of diameter 2
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On stable cutsets in line graphs
• On structural parameterizations of the matching cut problem
• 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
• Matching cutsets in graphs
• Parameterized Algorithms
• A Computing Procedure for Quantification Theory
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• Good edge-labelling of graphs

This page was built for publication: