An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An efficient distributed bridge-finding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for finding centers and medians in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distributed algorithm to find breadth first search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for constructing a minimum diameter spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully distributed (minimal) spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum self-repairing graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recognition of geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards minimum<i>k</i>-geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding all hinge vertices of a permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding all hinge vertices on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Graph Algorithm: Knot Detection / rank
 
Normal rank

Latest revision as of 15:39, 10 June 2024

scientific article; zbMATH DE number 2198785
Language Label Description Also known as
English
An efficient distributed algorithm for finding all hinge vertices in networks
scientific article; zbMATH DE number 2198785

    Statements

    An efficient distributed algorithm for finding all hinge vertices in networks (English)
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed systems
    0 references
    distributed algorithms
    0 references
    static asynchronous networks
    0 references
    0 references