Exact algorithms for difficult graph problems

DOI10.1007/978-3-642-04500-4MaRDI QIDQ3578291zbMATH OpenOpenAlexWikidataFDO

Authors Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke

Publication date 19 July 2010

Published in eXamen.press (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04500-4

zbMATH Keywords

cliquewidthconstrained satisfaction problemdecompositionfast exponential time algorithmfixed-parameter algorithmgraphtreewidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2234775
• A guide to graph algorithms
• Exact exponential algorithms.
• Parameterized algorithms
• scientific article; zbMATH DE number 3906496

Cited in

(8)

• Open problems around exact algorithms
• Exact algorithms for the vertex separator problem in graphs
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Algorithms and experiments for parameterized approaches to hard graph problems
• A guide to graph algorithms
• Exact Solution Algorithms for the Chordless Cycle Problem
• Algorithms for #BIS-hard problems on expander graphs
• Exact exponential algorithms.

This page was built for publication: Exact algorithms for difficult graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578291)