A Distributed Algorithm for Minimum-Weight Spanning Trees
From MaRDI portal
Publication:3964023
Cited in
(only showing first 100 items - show all)- Labeling schemes for tree representation
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Electing a leader in a ring with link failures
- A fully distributed (minimal) spanning tree algorithm
- An improved algorithm for finding the median distributively
- Optimal fault-tolerant distributed construction of a spanning forest
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- On the complexity of some arborescences finding problems on a multishop radio network
- Distributed processing of graphs: Fundamental cycles algorithm
- Distributed event algebras
- A parallel algorithm for finding a blocking flow in an acyclic network
- Scheduling in synchronous networks and the greedy algorithm
- The Steiner problem in distributed computing systems
- An optimal distributed algorithm for recognizing mesh-connected networks
- A principle for sequential reasoning about distributed algorithms
- A mechanical proof of Segall's PIF algorithm
- Petri net based verification of distributed algorithms: An example
- The local detection paradigm and its applications to self-stabilization
- Simple and efficient network decomposition and synchronization
- A survey on interval routing
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Sense of direction in distributed computing
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Distributed verification of minimum spanning trees
- A fast distributed approximation algorithm for minimum spanning trees
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Fast distributed approximation for TAP and 2-edge-connectivity
- Redundancy in distributed proofs
- Constant round distributed domination on graph classes with bounded expansion
- Latency, capacity, and distributed minimum spanning trees
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- GHS algorithm on a graph with random weights
- The sparsest additive spanner via multiple weighted BFS trees
- Low-congestion shortcut and graph parameters
- Distributed balanced color assignment on arbitrary networks
- Message lower bounds via efficient network synchronization
- Proof labeling schemes
- A survey of combinatorial optimization problems in multicast routing
- Map construction of unknown graphs by multiple agents
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Move-optimal gossiping among mobile agents
- A distributed methodology for approximate uniform global minimum sharing
- Leader election in well-connected graphs
- Message Lower Bounds via Efficient Network Synchronization
- Sparsifying congested cliques and core-periphery networks
- On the impact of sense of direction on message complexity
- Parallel and distributed algorithms in P systems
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- Distributed distance-bounded network design through distributed convex programming
- Fast distributed approximation for TAP and 2-edge-connectivity
- On the message complexity of distributed problems
- Distributed Broadcast Revisited: Towards Universal Optimality
- Distributed Disaster Disclosure
- Growing spanning trees in plasmodium machines
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- On risk-averse maximum weighted subgraph problems
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Introduction to local certification
- Optimal cost-sensitive distributed minimum spanning tree algorithm
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- Redundancy in distributed proofs
- Distributed MST and broadcast with fewer messages, and faster gossiping
- Time-message trade-offs in distributed algorithms
- Adapting local sequential algorithms to the distributed setting
- Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- Distributed graph algorithms and their complexity: an introduction
- Efficient algorithms for optimistic crash recovery
- Interval routing schemes allow broadcasting with linear message-complexity
- A linear-time optimal-message distributed algorithm for minimum spanning trees
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- A fast minimum spanning tree algorithm based on \(K\)-means
- Bounded approximate decentralised coordination via the max-sum algorithm
- An efficient distributed algorithm for finding all hinge vertices in networks
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
- The power of multimedia: Combining point-to-point and multi-access networks
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Distributed MST for constant diameter graphs
- Improved deterministic leader election in diameter-two networks
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- Local MST computation with short advice
- Learning Coefficient Heterogeneity over Networks: A Distributed Spanning-Tree-Based Fused-Lasso Regression
- A tree-based distributed method for cooperative flow field estimation
- Distributed MIS with Low Energy and Time Complexities
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Communication efficient self-stabilizing leader election
- Singularly optimal randomized leader election
- Maintaining a dynamic set of processors in a distributed system
- Sense of direction in processor networks
- A knowledge-based analysis of global function computation
- Distributed domination on sparse graph classes
- The topology of randomized symmetry-breaking distributed computing
- Clustering the wireless ad hoc networks: a distributed learning automata approach
- Faster leader election via mobile agents and its applications
- Time- and communication-efficient overlay network construction via gossip
- Distributed saddle point problems: lower bounds, near-optimal and robust algorithms
This page was built for publication: A Distributed Algorithm for Minimum-Weight Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964023)
