Computing the average distance of an interval graph
From MaRDI portal
Publication:1334633
DOI10.1016/0020-0190(93)90174-8zbMath0813.68141OpenAlexW2080137813MaRDI QIDQ1334633
Publication date: 25 September 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90174-8
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ A Wiener-type graph invariant for some bipartite graphs ⋮ Average distance and domination number ⋮ Average distance, minimum degree, and spanning trees ⋮ Average distance and connected domination ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ MAD trees and distance-hereditary graphs ⋮ Hitting Times, Cover Cost, and the Wiener Index of a Tree ⋮ Average distance in weighted graphs ⋮ On the average distance of the hypercube tree ⋮ On average distance in tournaments and Eulerian digraphs ⋮ A linear-time algorithm to compute a MAD tree of an interval graph
Cites Work
- A unified approach to domination problems on interval graphs
- Eigenvalues, diameter, and mean distance in graphs
- Mean distance in a graph
- Average distances in undirected graphs and the removal of vertices
- Average distance and independence number
- Mean distance in a tree
- On the sum of all distances in a graph or digraph
- Average distance in graphs with removed elements
- ON DISTANCES IN CHROMATIC GRAPHS
- The average distance and the independence number
- On mean distance in certain classes of graphs
- Edge-vulnerability and mean distance
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the average distance of an interval graph
