Algorithms and Data Structures
From MaRDI portal
Publication:5900780
DOI10.1007/b11837zbMath1278.68107MaRDI QIDQ5900780
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On the complexity of fixed parameter clique and dominating set, On miniaturized problems in parameterized complexity theory, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Exact algorithms and applications for tree-like Weighted Set Cover, A fixed-parameter tractability result for multicommodity demand flow in trees, Fixed-parameter tractability and data reduction for multicut in trees