Distributed averaging in the presence of a sparse cut
Abstract
Index Terms
- Distributed averaging in the presence of a sparse cut
Recommendations
The MAX-CUT of sparse random graphs
SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithmsA k-cut of a graph G = (V, E) is a partition of its vertex set into k parts; the size of the k-cut is the number of edges with endpoints in distinct parts. MAX-k-CUT is the optimization problem of finding a k-cut of maximal size and the case where k = 2 ...
Averaging 2-rainbow domination and Roman domination
For a graph G , let γ r 2 ( G ) and γ R ( G ) denote the 2-rainbow domination number and the Roman domination number, respectively. Fujita and Furuya (2013) proved γ r 2 ( G ) + γ R ( G ) 6 4 n ( G ) for a connected graph G of order n ( G ) at least 3. ...
Cut-Colorings in Coloring Graphs
This paper studies the connectivity and biconnectivity of coloring graphs. For $$k\in \mathbb {N}$$k?N, the k-coloring graph of a base graph G has vertex set consisting of the proper k-colorings of G and edge set consisting of the pairs of k-colorings ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tag
Qualifiers
- Demonstration
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 102Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in