Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710023
DOI10.1007/b136461zbMath1121.68459OpenAlexW2485841483MaRDI QIDQ5710023
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
A practical exact algorithm for the individual haplotyping problem MEC/GI ⋮ Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization ⋮ Optimizing adiabatic quantum program compilation using a graph-theoretic framework ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Separator-based data reduction for signed graph balancing ⋮ Confronting intractability via parameters ⋮ An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs ⋮ Iterative Compression for Exactly Solving NP-Hard Minimization Problems ⋮ Almost 2-SAT is fixed-parameter tractable ⋮ Unnamed Item ⋮ Speeding up Exact Algorithms With High Probability
This page was built for publication: Experimental and Efficient Algorithms
