Speeding up Exact Algorithms With High Probability

DOI10.1016/j.endm.2006.06.065zbMath1134.68591OpenAlexW2031058969MaRDI QIDQ3439468

Henning Fernau

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.065

zbMATH Keywords

parameterized algorithmsbipartization

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Finding odd cycle transversals.
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• A note on triangle-free and bipartite graphs
• Automated generation of search tree algorithms for hard graphs modification problems
• Experimental and Efficient Algorithms

This page was built for publication: Speeding up Exact Algorithms With High Probability