Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

DOI10.1007/11944836_15zbMath1177.68154OpenAlexW1890324419MaRDI QIDQ5385981

Sushmita Gupta, Saket Saurabh, Venkatesh Raman

Publication date: 17 April 2008

Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11944836_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Induced 2-regular subgraphs in \(k\)-chordal cubic graphs ⋮ Covering and packing in linear space ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ The complexity of uniform Nash equilibria and related regular subgraph problems ⋮ Maximum regular induced subgraphs in \(2P_3\)-free graphs

This page was built for publication: Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems