scientific article; zbMATH DE number 2080984
From MaRDI portal
Publication:4474081
zbMath1077.68727MaRDI QIDQ4474081
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230116.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
On the approximability of the minimum strictly fundamental cycle basis problem ⋮ The zoo of tree spanner problems ⋮ Minimum cut bases in undirected networks
This page was built for publication:
