Multicut on Graphs of Bounded Clique-Width

From MaRDI portal

Revision as of 21:59, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3167354

Jump to:navigation, search

DOI10.1007/978-3-642-31770-5_11zbMath1370.68232OpenAlexW78751179MaRDI QIDQ3167354

Martin Lackner, Stefan Rümmele, Reinhard Pichler, Stefan Woltran

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The behavior of clique-width under graph operations and graph transformations ⋮ Clique-width and edge contraction

This page was built for publication: Multicut on Graphs of Bounded Clique-Width

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3167354&oldid=16321934"