scientific article; zbMATH DE number 2081108

zbMath1052.68642MaRDI QIDQ4474221

Radha Krishnan, Balaji Raghavachari

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2245/22450232.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) Approximation algorithms (68W25)

Related Items (2)

What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Uses Software

• GraphBase

This page was built for publication: