Filters








176,929 Hits in 4.6 sec

Communication Complexity of Approximate Matching in Distributed Graphs

Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang, Marc Herbstritt
2015 Symposium on Theoretical Aspects of Computer Science  
In this paper we consider the communication complexity of approximation algorithms for maximum matching in a graph in the message-passing model of distributed computation.  ...  The input graph consists of n vertices and edges partitioned over a set of k sites. The output is an αapproximate maximum matching in the input graph which has to be reported by one of the sites.  ...  In this paper we focus on the performance measure of the communication complexity in the number of bits required to approximately compute a maximum matching in a graph.  ... 
doi:10.4230/lipics.stacs.2015.460 dblp:conf/stacs/HuangRVZ15 fatcat:lgmbp2qmdfef5h5ard7w3qtvyi

Communication Complexity of Approximate Matching in Distributed Graphs

Zengfeng Huang, Božidar Radunović, Milan Vojnović, Qin Zhang
unpublished
In this paper we consider the communication complexity of approximation algorithms for maximum matching in a graph in the message-passing model of distributed computation.  ...  The input graph consists of n vertices and edges partitioned over a set of k sites. The output is an α-approximate maximum matching in the input graph which has to be reported by one of the sites.  ...  In this paper we focus on the performance measure of the communication complexity in the number of bits required to approximately compute a maximum matching in a graph.  ... 
fatcat:konoz3ot55aldamvq2pnjzucs4

Distributed Vertex Cover Algorithms for Wireless Sensor Networks

Vedat Kavalci, Aybars Ural, Orhan Dagdeviren
2014 International Journal of Computer Networks & Communications  
The second algorithm finds a vertex cover from graph matching where Hoepman's weighted matching algorithm is used.  ...  The transmitted message count of the first algorithm is smallest among other algorithms where the third algorithm has turned out to be presenting the best results in vertex cover approximation ratio.  ...  Comparison of VCS approximation ratio results for the test graph CONCLUSIONS In this paper, we designed three distributed VC algorithms for WSNs to be used as a communication infrastructure.  ... 
doi:10.5121/ijcnc.2014.6107 fatcat:zhrooqkcgfhpjgufigdaajtm2q

Randomized Composable Coresets for Matching and Vertex Cover [article]

Sepehr Assadi, Sanjeev Khanna
2017 arXiv   pre-print
The main insight of our work is that the intractability of matching and vertex cover in the simultaneous communication model is inherently connected to an adversarial partitioning of the underlying graph  ...  While many fundamental graph problems admit efficient solutions in this model, two prominent problems are notably absent from the list of successes, namely, the maximum matching problem and the minimum  ...  Acknowledgements The first author would like to thank Sepideh Mahabadi and Ali Vakilian for many helpful discussions in the earlier stages of this work.  ... 
arXiv:1705.08242v1 fatcat:4y2um6pp7zg2djentde7kvvyua

Subject Index

2003 Journal of Discrete Algorithms  
, 409 Communication Cooperative computing with fragmentable and mergeable groups, 211 Communication complexity Exact communication costs for consensus and leader in a tree, 167 Compact routing  ...  tables The compactness of adaptive routing tables, 237 Complexity Cooperative computing with fragmentable and mergeable groups, 211 Compressed pattern matching Approximate string matching on Ziv-Lempel  ... 
doi:10.1016/s1570-8667(03)00075-3 fatcat:icg7if3uingibmjwy2mjud4rwe

Communication complexity of approximate maximum matching in the message-passing model [article]

Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang
2017 arXiv   pre-print
We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model.  ...  The output is required to be a matching in G that has to be reported by one of the sites, whose size is at least factor α of the size of a maximum matching in G.  ...  Notice that M k is a maximal matching in graph G, hence it is a 1/2-approximation of a maximum matching in G.  ... 
arXiv:1704.08462v1 fatcat:bvjfnlx5mne7fo6df2nxpgbdom

On Estimating Maximum Matching Size in Graph Streams [article]

Sepehr Assadi, Sanjeev Khanna, Yang Li
2017 arXiv   pre-print
We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner.  ...  On the lower bound front, we prove that any α-approximation algorithm for estimating matching size in dynamic graph streams requires Ω(√(n)/α^2.5) bits of space, even if the underlying graph is both sparse  ...  We are also thankful to anonymous reviewers of SODA for many valuable comments.  ... 
arXiv:1701.04364v1 fatcat:arpv4ufslranpbwe4weliv6evm

Noisy Boolean Hidden Matching with Applications [article]

Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou
2022 arXiv   pre-print
The one-way communication complexity of the Boolean Hidden Matching problem on a universe of size n is Θ(√(n)), resulting in Ω(√(n)) lower bounds for constant factor approximations to several of the aforementioned  ...  [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching, MAX-CUT, Schatten p-norm approximation, maximum acyclic  ...  The Boolean Hidden Matching (BHM) problem [KR06, GKdW06, BJK08, GKK + 08] is an important problem in communication complexity that has been a major tool for showing hardness of approximation in the streaming  ... 
arXiv:2107.02578v2 fatcat:6a24i67vi5fvpaoyv4y7u33rgu

Subject Index

2007 Journal of Discrete Algorithms  
patterns, 149 Parallel algorithms Approximating Huffman codes in parallel, 479 Parameterized matching Parameterized matching with mismatches, 135; Generalized func- tion matching, 514 Parity check  ...  results and solution to an open problem, 609 Wireless broadcast On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm, 323 Wireless LAN A station strategy  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi

Distributed Approximate Maximum Matching in the CONGEST Model

Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman, Michael Wagner
2018 International Symposium on Distributed Computing  
Next, we give a distributed algorithm that approximates the fractional weighted maximum matching problem in general graphs.  ...  We begin by giving a distributed algorithm that computes an exact maximum (unweighted) matching in bipartite graphs, in O(n log n) rounds.  ...  Beyond the simple 1/2-approximation provided by a maximal matching, there is series of works on the distributed complexity of obtaining a (1 − ε)-approximate maximum cardinality matching.  ... 
doi:10.4230/lipics.disc.2018.6 dblp:conf/wdag/AhmadiKO18 fatcat:bqjri65lznb7lbtr73vpeqmlge

Billion-Node Graph Challenges

Yanghua Xiao, Bin Shao
2017 IEEE Data Engineering Bulletin  
In this article, we elaborate the challenges in the management or mining on billon-node graphs in a distributed environment.  ...  In general, a distributed computing paradigm is necessary to overcome the billion-node graph challenges.  ...  Maximal match based coarsening however is unaware of the community structure of real graphs. Thus it is quite possible to break the community structure in the coarsened graphs.  ... 
dblp:journals/debu/XiaoS17 fatcat:jc3tzqfmhrd5xe5a64562drsaa

On the Distributed Complexity of Computing Maximal Matchings

Michał Hanckowiak, Michał Karonski, Alessandro Panconesi
1997 BRICS Report Series  
We show that maximal matchings can be computed in polylogarithmically-many communication rounds by deterministic distributed<br />algorithms.  ...  To our knowledge, maximal matchings are one of the very few examples<br />of non-trivial graph functions which can be computed deterministically in polylogarithmically-many communication rounds in the  ...  Acknowledgments The third author would like to thank the hospitality of the Adam Mickiewicz University, where much of this work was done, and the financial support of the Alexander von Humboldt foundation  ... 
doi:10.7146/brics.v4i38.18964 fatcat:rbyeqbuse5hy5mzhned2my5snu

Tight Bounds for Linear Sketches of Approximate Matchings [article]

Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev
2015 arXiv   pre-print
We resolve the space complexity of linear sketches for approximating the maximum matching problem in dynamic graph streams where the stream may include both edge insertion and deletion.  ...  graph streams, where n is the number of vertices in the graph.  ...  Finally, closely related to our work is a recent line of work on communication complexity of approximate matchings in the multi-party setting [9, 14, 24] .  ... 
arXiv:1505.01467v1 fatcat:rwpakvwnavaytlun6ohydvpuxm

Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication [article]

Christian Konrad, Peter Robinson, Viktor Zamaraev
2021 arXiv   pre-print
We give lower bounds on the communication complexity of graph problems in the multi-party blackboard model.  ...  We show that any non-trivial graph problem on n-vertex graphs has blackboard communication complexity Ω(n) bits, even if the edges of the input graph are randomly assigned to the k parties.  ...  Multi-party Communication Complexity of Graph Problems. Various graph problems have been studied in the multi-party number-in-hand communication settings.  ... 
arXiv:2103.07027v1 fatcat:uyutq7ngrffnhk3glijwdeb6cu

Adaptive Pattern Matching with Reinforcement Learning for Dynamic Graphs [article]

Hiroki Kanezashi, Toyotaro Suzumura, Dario Garcia-Gasulla, Min-hwan Oh, Satoshi Matsuoka
2018 arXiv   pre-print
On the other hand, the computation complexity of many graph pattern matching algorithms is expensive, and it is not affordable to extract patterns from million-scale graphs.  ...  Many incremental graph pattern matching algorithms which reduce the number of updates have been proposed to handle such dynamic graphs.  ...  I would like to thank the members of IBM T.J. Watson Research Center and Satoshi Matsuoka laboratory.  ... 
arXiv:1812.10321v1 fatcat:yyftg4ecazf4dk6rgc5ii5q7pe
« Previous Showing results 1 — 15 out of 176,929 results