Article

Free access

Improved distributed algorithms for coloring and network decomposition problems

Authors:

Alessandro Panconesi,

Aravind SrinivasanAuthors Info & Claims

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

Pages 581 - 592

https://doi.org/10.1145/129712.129769

Published: 01 July 1992 Publication History

PDF eReader

References

[1]

N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7:567-583, 1986.

Digital Library

Google Scholar

[2]

B. Awerbuch. Complexity of network synchronization. Y. Assoc. Comput. Mach., 32:804-823, 1985.

Digital Library

Google Scholar

[3]

B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proceedings o/ the IEEE Symposium on Foundations of Computer Science, pages 364-369, 1989.

Digital Library

Google Scholar

[4]

B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 503-513, 1990.

Digital Library

Google Scholar

[5]

B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. on Discrete Mathematics, 5(2), 1992.

Digital Library

Google Scholar

[6]

B. Berger and L. Cowen. Fast deterministic constructions of low-diameter network decompositions. MIT-LCS Technical Memo #460, April 1991.

Google Scholar

[7]

B. Bollob~s. Graph Theory. Springer Verlag, New York, 1979.

Google Scholar

[8]

P#. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In A CM Symposium on Theory of Computing, pages 206- 219, 1986.

Digital Library

Google Scholar

[9]

A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM J. Disc. Math., 1:434-446, 1989.

Digital Library

Google Scholar

[10]

P. Hajnal and E. Szemer#di. Brooks coloring in parallel. SIAM J. Disc. Math, 3(1):74-80, 1990.

Digital Library

Google Scholar

[11]

M. Karchmer and J. Naor. A fast parallel algorithm to color a graph with A colors. Journal of Algorithms, 9:83-91, 1988.

Digital Library

Google Scholar

[12]

H. J. Karloff. An NC algorithm for Brooks' theorem. Theoretical Computer Science, 68(1):89-103, 1989.

Digital Library

Google Scholar

[13]

G. F. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers, 30:93- 100, 1981.

Digital Library

Google Scholar

[14]

N. Linial. Distributive algorithms-global solutions from local data. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 331-335, 1987.

Digital Library

Google Scholar

[15]

N. Linial and M. Saks. Decomposing graphs into regions of small diameter. In Proceedings of the A CM/SIAM Symposium on Discrete Algorithms, pages 320-330, 1991.

Digital Library

Google Scholar

[16]

M. Luby. A fast parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986.

Digital Library

Google Scholar

[17]

M. Luby. Removing randomness in parallel computation without a processor penalty. In Procecd#r#g# of the IEEE Symposium on Foundations of Computer Science, pages 162-173, 1988.

Google Scholar

Cited By

View all

Balliu ABrandt SKuhn FNowicki KOlivetti DRotenberg ESuomela JKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Local Advice and Local DecompressionProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662805(117-120)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662805
Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Chang YLi ZOshman RNolin AHalldorsson MBalliu A(2023)The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594562(32-43)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594562
Show More Cited By

Index Terms

Improved distributed algorithms for coloring and network decomposition problems

Recommendations

Distributed Strong Diameter Network Decomposition: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

For a pair of positive parameters D,Χ, a partition P of the vertex set V of an n-vertex graph G = (V,E) into disjoint clusters of diameter at most D each is called a (D,Χ) network decomposition}, if the supergraph G(P), obtained by contracting each of ...
Distributed Algorithms for Network Recognition Problems

The problem of recognizing whether a given network is a tree, ring, star, complete graph, or bipartite graph is considered. Unified algorithms to recognize if the network is any one of the above are presented in each of three classes of algorithms-with ...
Distributed strong diameter network decomposition
Abstract
For a pair of positive parameters D , χ, a partition P of the vertex set V of an n-vertex graph G = ( V , E ) into disjoint clusters of diameter at most D each is called a ( D , χ ) network decomposition, if the ...

Comments

Information & Contributors

Information

Published In

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

July 1992

794 pages

ISBN:0897915119

DOI:10.1145/129712

Chairmen:
Rao Kosaraju
Johns Hopkins Univ., Baltimore, MD
,
Mike Fellows
Univ. of Victoria, Victoria, BC, Canada
,
Avi Wigderson
Hebrew University; Princeton Univ., Princeton, NJ
,
John Ellis
Univ. of Victoria, Victoria, BC, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC92

Sponsor:

SIGACT

STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992

May 4 - 6, 1992

British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

81
Total Citations
View Citations
1,194
Total Downloads

Downloads (Last 12 months)121
Downloads (Last 6 weeks)15

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Balliu ABrandt SKuhn FNowicki KOlivetti DRotenberg ESuomela JKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Local Advice and Local DecompressionProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662805(117-120)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662805
Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Chang YLi ZOshman RNolin AHalldorsson MBalliu A(2023)The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594562(32-43)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594562
Ghaffari MGrunau CSaha BServedio R(2023)Faster Deterministic Distributed MIS and Approximate MatchingProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585243(1777-1790)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585243
Metkewar PBokhare A(2023)One stride ahead Advancements in Dispersed Graph Coloring2023 International Conference for Advancement in Technology (ICONAT)10.1109/ICONAT57137.2023.10080064(1-3)Online publication date: 24-Jan-2023
https://doi.org/10.1109/ICONAT57137.2023.10080064
Corsini TDeschamps QFeghali CGonçalves DLanglois HTalon A(2023)Partitioning into degenerate graphs in linear timeEuropean Journal of Combinatorics10.1016/j.ejc.2023.103771114(103771)Online publication date: Dec-2023
https://doi.org/10.1016/j.ejc.2023.103771
Assadi SKumar PMittal PLeonardi SGupta A(2022)Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloringProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520005(234-247)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520005
Ghaffari MPortmann JAgrawal KLee I(2022)Average Awake Complexity of MIS and MatchingProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538566(45-55)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538566
Rozhon VElkin MGrunau CHaeupler B(2022)Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00107(1114-1121)Online publication date: Oct-2022
https://doi.org/10.1109/FOCS54457.2022.00107
Ghaffari MKuhn F(2022)Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00101(1009-1020)Online publication date: Feb-2022
https://doi.org/10.1109/FOCS52979.2021.00101
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Distributed Strong Diameter Network Decomposition: Extended Abstract

Distributed Algorithms for Network Recognition Problems

Distributed strong diameter network decomposition