Publication:4448767
From MaRDI portal
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, Unnamed Item, Matching cut in graphs with large minimum degree, Finding matching cuts in \(H\)-free graphs, \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs, Computing vertex-surjective homomorphisms to partially reflexive trees, Algorithms solving the matching cut problem, On stable cutsets in claw-free graphs and planar graphs, Satisfactory graph partition, variants, and generalizations, A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter, Surjective \(H\)-colouring: new hardness results, Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization, Complexity results for two kinds of colored disconnections of graphs, On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs, Vertex partitioning problems on graphs with bounded tree width, Perfect matching cuts partitioning a graph into complementary subgraphs, Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms, Algorithms Solving the Matching Cut Problem, Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees
