-
...in this paper we analyze a spectral heuristic for the minimum bisection problem on random graphs gn(p,p'), which are...as n ← ∞ the heuristic finds a minimum bisection of gn(p,p') along with a certificate of optimality in polynomial...
-
-
...we study random instances of a general graph partitioning problem: the vertex set of the random input graph g consists of k classes...is that with high probability a partition s
1,...,s
k
of g that coincides with v
1,...,v
k
on a huge subgraph core(g) can...
-
...consider the problem of finding a maximum independent set in a random graph. the random graph g is modelled as follows...to be nonempty. we present a polynomial time algorithms that with high probability (over the random choice of random graph g, and without being given...
-
...consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) from a random graph. during the last 30 years...real-world networks, albeit looking random in some sense, cannot sensibly be described by these models. therefore, a variety of new types of random graphs have been introduced. one of...
-
...the mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing...subset. when considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties...
-
...sure upper bounds on the bisection width of random d-regular graphs, for any value of d. the...analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. we provide bounds for 5≤d≤12. we also give empirical...
-
...close together. layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. in...cut, v ertex separation and bisection. we first prove that some of these problems remain np-complete even for geometric graphs. afterwards, we compute lo wer...
-
...let g3n,p,3 be a random 3-colorable graph on a set of 3n vertices generated...produce optimal k-colorings of random k-colorable graphs in a similar model as well as...
-
Unknown
...let g3n;p;3 be a random 3-colorable graph on a set of 3n vertices generated...produce optimal k-colorings of random k-colorable graphs in a similar model as well as...