An efficient distributed algorithm for canonical labeling on directed split-stars (Q1003736): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Super-connectivity and super-edge-connectivity for some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm to find \(k\)-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal feedback vertex sets in directed split‐stars / rank
 
Normal rank

Latest revision as of 03:37, 29 June 2024

scientific article
Language Label Description Also known as
English
An efficient distributed algorithm for canonical labeling on directed split-stars
scientific article

    Statements

    An efficient distributed algorithm for canonical labeling on directed split-stars (English)
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    directed split-stars
    0 references
    distributed algorithms
    0 references
    canonical labeling
    0 references
    message complexity
    0 references
    time complexity
    0 references
    0 references