Computing the average distance of an interval graph (Q1334633): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90174-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080137813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distances in undirected graphs and the removal of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance in graphs with removed elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distance and the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance and independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean distance in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-vulnerability and mean distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mean distance in certain classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of all distances in a graph or digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the all-pair shortest path problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON DISTANCES IN CHROMATIC GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean distance in a tree / rank
 
Normal rank

Latest revision as of 16:59, 22 May 2024

scientific article
Language Label Description Also known as
English
Computing the average distance of an interval graph
scientific article

    Statements

    Identifiers