scientific article; zbMATH DE number 1953085
From MaRDI portal
Publication:4414488
zbMath1022.68091MaRDI QIDQ4414488
Simone Dantas, Celina M. Herrera de Figueiredo, Luérbio Faria
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730092.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ The sandwich problem for cutsets: clique cutset, \(k\)-star cutset ⋮ Unnamed Item
This page was built for publication:
