Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree

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

Marek Cygan, Marcin Pilipczuk

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

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

15A15: Determinants, permanents, traces, other special matrix functions

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)