scientific article; zbMATH DE number 2086657

zbMath1057.68646MaRDI QIDQ4737194

Piotr Berman, Marek Karpinski

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800623.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

The inapproximability of lattice and coding problems with preprocessing ⋮ On minimum bisection and related partition problems in graphs with bounded tree width ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ On the Complexity of Computing the k-restricted Edge-connectivity of a Graph

This page was built for publication: