Parameterized and Exact Computation
From MaRDI portal
Publication:5311527
DOI10.1007/b100584zbMath1104.68543MaRDI QIDQ5311527
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100584
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy, Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem, Clustering with partial information, On treewidth, separators and Yao's garbling, Clustering with Partial Information