scientific article; zbMATH DE number 890671

zbMATH Open0847.05051MaRDI QIDQ4882555FDOQ4882555

Authors: R. C. Entringer, László A. Székely, Daniel J. Kleitman 

Publication date: 18 June 1996

Title of this publication is not available (Why is that?)

Recommendations

• Average distance, minimum degree, and spanning trees
• Average distance, independence number, and spanning trees
• A linear-time algorithm to compute a MAD tree of an interval graph
• Distance preserving subtrees in minimum average distance spanning trees

zbMATH Keywords

approximation algorithmsspanning treeaverage distanceWiener number

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12)

Cited In (18)

• MAD trees and distance-hereditary graphs
• A survey of the all-pairs shortest paths problem and its variants in graphs
• Spanning trees: A survey
• Metric properties of generalized Sierpiński graphs over stars
• The non-approximability of bicriteria network design problems
• On minimum average stretch spanning trees in polygonal 2-trees
• On minimum average stretch spanning trees in polygonal 2-trees
• Short proofs of some theorems on bounds of the average distances of trees
• Extremal values for ratios of distances in trees
• Title not available (Why is that?)
• Average distance, minimum degree, and irregularity index
• Average distance, minimum degree, and spanning trees
• Distance preserving subtrees in minimum average distance spanning trees
• Average distance, independence number, and spanning trees
• On the intercluster distance of a tree metric
• A distance approximating trees
• A linear-time algorithm to compute a MAD tree of an interval graph
• On the minimum average distance spanning tree of the hypercube

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 Q4882555)