Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree

DOI10.1007/978-3-642-39206-1_31zbMath1327.68130arXiv1302.3763OpenAlexW2167034311MaRDI QIDQ5326575

Marcin Pilipczuk, Marek Cygan

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3763

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Solving SCS for bounded length strings in fewer than \(2^n\) steps ⋮ Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants ⋮ Unnamed Item

This page was built for publication: Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree