scientific article; zbMATH DE number 841632

MaRDI QIDQ4863482zbMATH OpenFDO

Authors Ortrud R. Oellermann

Publication date 22 April 1996

zbMATH Keywords

average distancedistance hereditarylinear time algorithm

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On computing the average distance for some chordal-like graphs
• On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
• Estimating the distance to a hereditary graph property
• Computing the average distance of an interval graph
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Linear-time algorithm for paired-domination on distance-hereditary graphs
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• Average distance in graphs and eigenvalues
• scientific article; zbMATH DE number 5130720

Cited in

(6)

• A linear-time algorithm to compute a MAD tree of an interval graph
• Computing the average distance of an interval graph
• Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
• On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
• Average distance and connected domination
• Eccentricity function in distance-hereditary 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 Q4863482)