Algorithms and Data Structures
From MaRDI portal
Publication:5394241
DOI10.1007/11534273zbMath1161.68690OpenAlexW3010016474MaRDI QIDQ5394241
Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Compactors for parameterized counting problems ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Confronting intractability via parameters ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ Unnamed Item
This page was built for publication: Algorithms and Data Structures
