scientific article; zbMATH DE number 1305449
From MaRDI portal
Publication:4252334
zbMath0968.90021MaRDI QIDQ4252334
Publication date: 23 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
The size of graphs with given feedback vertex number ⋮ The decycling number of outerplanar graphs ⋮ On the decycling number of generalized Kautz digraphs ⋮ Planar graph bipartization in linear time ⋮ A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Optimal bandwidth utilization of all-optical ring with a converter of degree 4. ⋮ New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
This page was built for publication:
