#### Filter Results:

- Full text PDF available (28)

#### Publication Year

2002

2017

- This year (6)
- Last 5 years (24)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kai-Min Chung, Seth Pettie, Hsin-Hao Su
- Distributed Computing
- 2014

The Lovasz Local Lemma (LLL), introduced by Erdos and Lovasz in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n "bad" events do not happen with non-zero probability, provided that the events have limited dependence. However, the LLL itself does not suggest how to find a point avoiding all bad events. Since the… (More)

- Ran Duan, Seth Pettie, Hsin-Hao Su
- ArXiv
- 2011

The maximum cardinality and maximum weight matching problems can be solved in time Õ(m √ n), a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article we demonstrate that this “m √ n barrier” is extremely fragile, in the following sense. For any > 0, we give an algorithm that… (More)

- David G. Harris, Johannes Schneider, Hsin-Hao Su
- STOC
- 2016

The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆+1)-coloring running in O(√log ∆)+ 2^O(√log log n) rounds with probability 1-1/n^Ω(1) in a graph with n nodes and maximum degree ∆. This implies that the… (More)

- Seth Pettie, Hsin-Hao Su
- ICALP
- 2013

Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find… (More)

- Ran Duan, Hsin-Hao Su
- SODA
- 2012

Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow… (More)

- Hsin-Hao Su, Chin Lung Lu, Chuan Yi Tang
- Inf. Process. Lett.
- 2008

Given a tree T with weight and length on each edge, as well as a lower bound L and an upper bound U , the so-called length-constrained maximum-density subtree problem is to find a maximum-density subtree in T such that the length of this subtree is between L and U . In this study, we present an algorithm that runs in O(nU log n) time for the case when the… (More)

- Mohsen Ghaffari, Hsin-Hao Su
- SODA
- 2017

We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node’s degree is split almost uniformly. Our findings lead to answers for a number of problems, a sampling of which includes: • We present a poly log n round deterministic… (More)

- Seth Pettie, Hsin-Hao Su
- Inf. Comput.
- 2015

Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of ∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find… (More)

- Danupon Nanongkai, Hsin-Hao Su
- DISC
- 2014

We study the problem of computing the minimum cut in a weighted distributed messagepassing networks (the CONGEST model). Let λ be the minimum cut, n be the number of nodes (processors) in the network, and D be the network diameter. Our algorithm can compute λ exactly in O(( √ n log∗ n+D)λ log n) time. To the best of our knowledge, this is the first paper… (More)

Graph coloring is a central problem in distributed computing. Both vertexand edge-coloring problems have been extensively studied in this context. In this paper we show that a (2∆ − 1)-edge-coloring can be computed in time smaller than log n for any > 0, specifically, in e √ log logn) rounds. This establishes a separation between the (2∆ − 1)-edge-coloring… (More)