Triangles, 4-Cycles and Parameterized (In-)Tractability

DOI10.1007/11785293_29zbMath1142.68374OpenAlexW1839843MaRDI QIDQ5757905

Saket Saurabh, Venkatesh Raman

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number ⋮ Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes ⋮ Finding a potential community in networks ⋮ Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles ⋮ Parameterized complexity of the maximum independent set problem and the speed of hereditary properties

This page was built for publication: Triangles, 4-Cycles and Parameterized (In-)Tractability