Distributed verification of minimum spanning trees (Q1954247): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-007-0025-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-007-0025-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023425290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local detection paradigm and its applications to self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed reset / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel verification of minimum spanning trees in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory requirements for silent stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / 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: Q4796196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crash failures can drive protocols to arbitrary states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear verification for spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / 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: A simpler minimum spanning tree verification algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal EREW PRAM algorithm for minimum spanning tree verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Path Compression on Balanced Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-007-0025-1 / rank
 
Normal rank

Latest revision as of 15:24, 16 December 2024

scientific article
Language Label Description Also known as
English
Distributed verification of minimum spanning trees
scientific article

    Statements

    Distributed verification of minimum spanning trees (English)
    0 references
    0 references
    0 references
    20 June 2013
    0 references
    network algorithms
    0 references
    graph property verification
    0 references
    labeling schemes
    0 references
    minimum spanning tree
    0 references
    proof labeling schemes
    0 references
    self stabilization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references