scientific article; zbMATH DE number 5228
From MaRDI portal
Publication:4712944
Cited in
(8)- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Easy computation of eccentricity approximating trees
- An improved algorithm for the k-source maximum eccentricity spanning trees
- Eccentricity approximating trees
- Helly-gap of a graph and vertex eccentricities
- Eccentricity approximating trees (extended abstract)
- scientific article; zbMATH DE number 10563 (Why is no real title available?)
- Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs
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 Q4712944)