Distributed edge coloration for bipartite networks
From MaRDI portal
Publication:2377126
DOI10.1007/s00446-009-0082-8zbMath1267.68310MaRDI QIDQ2377126
Chi-Hung Tzeng, Shing-Tsaan Huang
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-009-0082-8
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited
- A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
- Stabilizing time-adaptive protocols
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Parallel I/O scheduling using randomized, distributed edge coloring algorithms.
- Parallel composition for time-to-fault adaptive stabilization
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Self-stabilizing systems in spite of distributed control
- Bipartite Edge Coloring in $O(\Delta m)$ Time
- [https://portal.mardi4nfdi.de/wiki/Publication:4242913 K�nig's edge coloring theorem without augmenting paths]
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Nearly optimal distributed edge coloring in O(log log n) rounds
- Algorithms for edge coloring bipartite graphs
- Principles of Distributed Systems
