Pages that link to "Item:Q3964023"
From MaRDI portal
The following pages link to A Distributed Algorithm for Minimum-Weight Spanning Trees (Q3964023):
Displaying 50 items.
- On the impact of sense of direction on message complexity (Q287123) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- Bounded approximate decentralised coordination via the max-sum algorithm (Q543622) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Local MST computation with short advice (Q613116) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- Clustering the wireless ad hoc networks: a distributed learning automata approach (Q666084) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- From reaction-diffusion to physarum computing (Q734218) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- A theorem on atomicity in distributed algorithms (Q913499) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- A fully distributed (minimal) spanning tree algorithm (Q1087548) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Optimal fault-tolerant distributed construction of a spanning forest (Q1105570) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- Distributed processing of graphs: Fundamental cycles algorithm (Q1186357) (← links)
- Distributed event algebras (Q1191023) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Scheduling in synchronous networks and the greedy algorithm (Q1292430) (← links)
- The Steiner problem in distributed computing systems (Q1310949) (← links)
- An optimal distributed algorithm for recognizing mesh-connected networks (Q1314373) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- A mechanical proof of Segall's PIF algorithm (Q1362774) (← links)
- Petri net based verification of distributed algorithms: An example (Q1377301) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- A survey on interval routing (Q1575744) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- Sense of direction in distributed computing (Q1870525) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
