scientific article; zbMATH DE number 6861983

DOI10.4230/LIPIcs.ISAAC.2016.50zbMath1398.68197MaRDI QIDQ4636534

Van Bang Le, Hoàng-Oanh Le

Publication date: 19 April 2018

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

zbMATH Keywords

computational complexitygraph algorithmNP-hardnessdecomposable graphmatching cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Parameterized complexity of perfectly matched sets ⋮ Unnamed Item ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ An FPT algorithm for matching cut and d-cut

This page was built for publication: