scientific article; zbMATH DE number 2044946

zbMath1042.68642MaRDI QIDQ4448767

Maurizio Patrignani, Maurizio Pizzonia

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040284.htm

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (19)

Vertex partitioning problems on graphs with bounded tree width ⋮ Perfect matching cuts partitioning a graph into complementary subgraphs ⋮ Algorithms Solving the Matching Cut Problem ⋮ Finding matching cuts in \(H\)-free graphs ⋮ Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ Algorithms solving the matching cut problem ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Unnamed Item ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter ⋮ Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees ⋮ Surjective \(H\)-colouring: new hardness results ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Computing vertex-surjective homomorphisms to partially reflexive trees ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ Complexity results for two kinds of colored disconnections of graphs ⋮ Matching cut in graphs with large minimum degree ⋮ Unnamed Item ⋮ On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs

This page was built for publication: