Sciweavers

5 search results - page 1 / 1
» The Peculiar Phase Structure of Random Graph Bisection
Sort
View
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 5 months ago
The Peculiar Phase Structure of Random Graph Bisection
Allon G. Percus, Gabriel Istrate, Bruno Gonç...
FOCS
1993
IEEE
13 years 9 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
STACS
2010
Springer
13 years 12 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
AAAI
2011
12 years 4 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev