Linear-time graph distance and diameter approximation (Q2827756): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Raphael C. S. Machado / rank
Normal rank
 
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
Normal rank
 
Property / author
 
Property / author: Raphael C. S. Machado / rank
 
Normal rank
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
 
Normal rank
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.1111/itor.12236 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2270090871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of BFS to determine a graph's diameter / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:22, 12 July 2024

scientific article
Language Label Description Also known as
English
Linear-time graph distance and diameter approximation
scientific article

    Statements

    Linear-time graph distance and diameter approximation (English)
    0 references
    0 references
    21 October 2016
    0 references
    0 references
    graph diameter
    0 references
    distance in graphs
    0 references
    breadth first search
    0 references
    linear-time algorithm
    0 references
    0 references