scientific article; zbMATH DE number 890671
From MaRDI portal
Publication:4882555
zbMath0847.05051MaRDI QIDQ4882555
László A. Székely, Roger Entringer, Daniel J. Kleitman
Publication date: 18 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ On the intercluster distance of a tree metric ⋮ Extremal values for ratios of distances in trees ⋮ Average distance, minimum degree, and irregularity index ⋮ MAD trees and distance-hereditary graphs ⋮ Spanning trees: A survey ⋮ On the minimum average distance spanning tree of the hypercube ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ The non-approximability of bicriteria network design problems ⋮ Average Distance, Independence Number, and Spanning Trees
This page was built for publication:
