Computing the average distance of an interval graph
type: Item
instance of: scholarly article
title: Computing the average distance of an interval graph
zbMATH Open document ID: 0813.68141
DOI: 10.1016/0020-0190(93)90174-8
published in: Information Processing Letters
publication date: 1994-09-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 643652
zbMATH Keywords: graph algorithms
zbMATH Keywords: average distance
zbMATH Keywords: interval graph
author: Peter Dankelmann
MaRDI profile type: Publication
full work available at URL: 0020-0190(93)90174-8
OpenAlex ID: W2080137813
cites work: Average distances in undirected graphs and the removal of vertices
cites work: Average distance in graphs with removed elements
cites work: The average distance and the independence number
cites work: Average distance and independence number
cites work: Mean distance in a graph
cites work: Q3832606
cites work: Edge-vulnerability and mean distance
cites work: Q3781134
cites work: Q3328583
cites work: On mean distance in certain classes of graphs
cites work: Eigenvalues, diameter, and mean distance in graphs
cites work: On the sum of all distances in a graph or digraph
cites work: A unified approach to domination problems on interval graphs
cites work: An optimal algorithm to solve the all-pair shortest path problem on interval graphs
cites work: ON DISTANCES IN CHROMATIC GRAPHS
cites work: Q3772252
cites work: Mean distance in a tree
description: scientific article; zbMATH DE number 643652