# Large Cuts with Local Algorithms on Triangle-Free Graphs

@article{Hirvonen2014LargeCW,
title={Large Cuts with Local Algorithms on Triangle-Free Graphs},
author={Juho Hirvonen and Joel Rybicki and Stefan Schmid and Jukka Suomela},
journal={Electron. J. Comb.},
year={2014},
volume={24},
pages={4}
}
• Published 11 February 2014
• Computer Science, Mathematics
• Electron. J. Comb.
We study the problem of finding large cuts in $d$-regular triangle-free graphs. In prior work, Shearer (1992) gives a randomised algorithm that finds a cut of expected size $(1/2 + 0.177/\sqrt{d})m$, where $m$ is the number of edges. We give a simpler algorithm that does much better: it finds a cut of expected size $(1/2 + 0.28125/\sqrt{d})m$. As a corollary, this shows that in any $d$-regular triangle-free graph there exists a cut of at least this size. Our algorithm can be interpreted as a…

## Figures and Tables from this paper

• Computer Science, Mathematics
ALGOSENSORS
• 2017
These algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal on Computing, 2015) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest.
• Computer Science, Mathematics
DISC
• 2020
In triangle-free graphs, the girth can be exactly computed in time polynomially faster than the best known bounds for general graphs, and it is shown that no analogous result is currently known for sequential algorithms.
• Computer Science
ICALP
• 2019
An in-depth study of the fundamental problems of finding small subgraphs in distributed dynamic networks shows that, perhaps somewhat surprisingly, other problems exhibit a wide range of complexities in terms of the trade-offs between their round and bandwidth complexities.
• Computer Science
PODC
• 2022
Deterministic distributed algorithms for listing cliques of size p in n1 - 2/p + o(1) rounds in the Congest model are given and are the first non-trivial deterministic distributedgorithms to be given.
• Computer Science
ITCS
• 2022
It is proved that every (quantum or classical) one-local algorithm achieves on D-regular graphs of girth > 5 a maximum cut of at most 1/2, and it is suggested that it could be possible to extend them beyond these constraints.
• Computer Science, Mathematics
PODC
• 2017
This paper presents the first algorithms with sublinear complexity for triangle finding and triangle listing in the standard CONGEST model, where the communication topology is the same as the topology of the network.
• Computer Science, Mathematics
STACS
• 2020
A quantum distributed algorithm that solves the triangle finding problem in $\tilde O(n^{1/4})$ rounds in the CONGEST model gives another example of quantum algorithm beating the best known classical algorithms in distributed computing.
• Computer Science
DISC
• 2018
This paper defines a robust family of local sequential algorithms which can be easily adapted to the distributed setting, and develops algorithms which have the same approximation guarantees as their sequential counterparts, up to a constant additive $\epsilon$ factor.
This paper defines a robust family of local sequential algorithms which can be easily adapted to the distributed setting, and develops algorithms which have the same approximation guarantees as their sequential counterparts, up to a constant additive $\epsilon$ factor.

## References

SHOWING 1-10 OF 21 REFERENCES

• N. Linial
• Mathematics, Computer Science
SIAM J. Comput.
• 1992
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.
This paper shows that the chromatic number of any t-neighborhood graph is at most A + 1 for some = O(log 3 n), which implies that current techniques for proving lower bounds on the distributed complexity of A - 1-coloring are not strong enough to give a negative answer to the above open problem.
• Computer Science, Mathematics
SIROCCO
• 2015
It is shown that for infinitely many n the time complexity is precisely $\frac{1}{2} \log^{*} n$ communication rounds.
I published several papers with similar titles. One of my latest ones [13] (also see [16] and the yearly meetings at Boca Raton or Baton Rouge) contains, in the introduction, many references to my
AbstractIt is shown that there exists a positivec so that for any large integerm, any graph with 2m2edges contains a bipartite subgraph with at least $$m^2 + m/2 + c\sqrt m$$ edges. This is tight up
• J. Shearer
• Mathematics
Random Struct. Algorithms
• 1992
It follows as a corollary that k ⩾ m/2 + cm3/4 is the maximum number of edges in a bipartite subgraph of G.
• Computer Science
Proceedings of 37th Conference on Foundations of Computer Science
• 1996
The authors present a linear-programming based method for finding "gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in
This work surveys the state-of-the-art in the field of local algorithm design, covering impossibility results, deterministic local algorithms, randomized localgorithms, and local algorithms for geometric graphs.
In the last two decades, the theory of Ramanujan graphs has gained prominence primarily for two reasons. First, from a practical viewpoint, these graphs resolve an extremal problem in communication
• Computer Science
Distributed Computing
• 2008
This paper studies the information sensitivity of distributed graph coloring and finds that giving a lot of information to the nodes in order to ensure fast computation of the solution is more information insensitive than giving little advice.