#### Filter Results:

- Full text PDF available (42)

#### Publication Year

2006

2017

- This year (14)
- Last 5 years (76)
- Last 10 years (94)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ran Duan, Seth Pettie
- SODA
- 2009

Given a directed graph with a capacity on each edge, the all-pairs bottleneck paths (APBP) problem is to determine , for all vertices s and t, the maximum flow that can be routed from s to t. For dense graphs this problem is equivalent to that of computing the (max, min)-transitive closure of a real-valued matrix. In this paper, we give a (max, min)-matrix… (More)

- Ran Duan, Seth Pettie
- J. ACM
- 2014

The <i>maximum cardinality</i> and <i>maximum weight matching</i> problems can be solved in <i>Õ</i>(<i>m</i>√<i>n</i>) time, a bound that has resisted improvement despite decades of research. (Here <i>m</i> and <i>n</i> are the number of edges and vertices.) In this article, we demonstrate that this “<i>m</i>√<i>n</i>… (More)

- Ran Duan, Seth Pettie
- SODA
- 2009

Spontaneous failure is an unavoidable aspect of all networks , particularly those with a physical basis such as communications networks or road networks. Whether due to malicious coordinated attacks or other causes, failures temporarily change the topology of the network and, as a consequence, its connectivity and distance metric. In this paper we look at… (More)

- Ran Duan, Junrong Liang, +10 authors Xin Wang
- Journal of clinical microbiology
- 2014

We developed a multilocus sequence typing (MLST) scheme and used it to study the population structure and evolutionary relationships of three pathogenic Yersinia species. MLST of these three Yersinia species showed a complex of two clusters, one composed of Yersinia pseudotuberculosis and Yersinia pestis and the other composed of Yersinia enterocolitica.… (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 log N) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(N m √ n) by Gabow and O(m √ n log (nN)) by… (More)

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

The maximum cardinality and maximum weight matching problems can be solved in time˜O(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)

- Ran Duan, Mingsong Bi, Chris Gniady
- 2011 International Green Computing Conference and…
- 2011

Recent development of sophisticated smartphones has made them indispensable part of our everyday life. However, advances in battery technology cannot keep up with the demand for longer battery life. Subsequently, energy efficiency has become one of the most important factors in designing smartphones. Multitasking and better multimedia features in the mobile… (More)

- Ran Duan, Kurt Mehlhorn
- Inf. Comput.
- 2013

We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities. Our algorithm views the allocation of money as flows and iteratively improves the balanced flow as in [Devanur et al. 2008] for Fisher's model. We develop new methods to carefully deal with the flows and… (More)

- Chih-Lin I, Yannan Yuan, Jinri Huang, Shijia Ma, Chunfeng Cui, Ran Duan
- IEEE Communications Magazine
- 2015

- Ran Duan
- ICALP
- 2010

We study the " subgraph connectivity " problem for undi-rected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a graph G, and answer the connectivity between two vertices in the subgraph of G induced by the active vertices. In this paper, we solve two open problems in subgraph connectivity. We give the… (More)