scientific article; zbMATH DE number 1305449

MaRDI QIDQ4252334zbMATH OpenFDO

Authors Amit Kumar, Jon M. Kleinberg

Publication date 23 September 2001

zbMATH Keywords

communication pathsnetworkoptical routingpolynomial-time algorithmundirected feedback vertex set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

• Wavelength conversion in optical networks
• Wavelength conversion in all-optical networks with shortest-path routing
• Algorithms and Computation
• scientific article; zbMATH DE number 1303573

Cited in

(12)

• 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.
• The decycling number of outerplanar graphs
• The size of graphs with given feedback vertex number
• Planar graph bipartization in linear time
• Wavelength conversion in optical networks
• On the decycling number of generalized Kautz digraphs
• Sparse and limited wavelength conversion in all-optical tree networks
• On decycling and forest numbers of Cartesian products of trees
• On maximum induced forests of the balanced bipartite graphs
• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
• Wavelength conversion in all-optical networks with shortest-path routing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252334)