scientific article; zbMATH DE number 1953095
From MaRDI portal
Publication:4414499
zbMath1022.68599MaRDI QIDQ4414499
Ivan Rapaport, Fedor V. Fomin, Martin Matamala
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730211.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Bounds for the oriented diameter of planar triangulations ⋮ Algorithms for graphs with small octopus