Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897572
DOI10.1007/11604686zbMath1171.05428MaRDI QIDQ5897572
Peter Rossmanith, Joachim Kneis, Daniel Mölle, Stefan Richter
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets ⋮ Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ Trimmed Moebius inversion and graphs of bounded degree ⋮ Exact algorithms for exact satisfiability and number of perfect matchings ⋮ A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach ⋮ Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems ⋮ Faster algorithms for counting subgraphs in sparse graphs ⋮ On two techniques of combining branching and treewidth ⋮ Pathwidth of cubic graphs and exact algorithms ⋮ $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
Uses Software
This page was built for publication: Graph-Theoretic Concepts in Computer Science
