Pages that link to "Item:Q1954247"
From MaRDI portal
The following pages link to Distributed verification of minimum spanning trees (Q1954247):
Displaying 18 items.
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Local mending (Q2097329) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Randomized distributed decision (Q2256969) (← links)
- The ANTS problem (Q2401118) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090916) (← links)
- (Q5090917) (← links)
- (Q6065460) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
