Pages that link to "Item:Q2784494"

The following pages link to A polylogarithmic approximation of the minimum bisection (Q2784494):

Displaying 29 items.

• Graph clustering (Q458448) (← links)
• Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
• Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
• Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
• On the complexity of finding balanced oneway cuts (Q1014383) (← links)
• Balanced cut approximation in random geometric graphs (Q1029344) (← links)
• Distributed balanced partitioning via linear embedding (Q2005567) (← links)
• Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking (Q2174897) (← links)
• Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
• Exact recovery in the Ising blockmodel (Q2313270) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• Complexity of the bisection method (Q2381525) (← links)
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) (← links)
• Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
• A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (Q2941581) (← links)
• A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
• Vertex Bisection is Hard, too (Q3184606) (← links)
• Approximating the minimum bisection size (extended abstract) (Q3192022) (← links)
• Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
• (Q5002797) (← links)
• (Q5075784) (← links)
• (Q5111755) (← links)
• Dynamic Balanced Graph Partitioning (Q5130579) (← links)
• Bisections above Tight Lower Bounds (Q5200505) (← links)
• A Polylogarithmic Approximation of the Minimum Bisection (Q5470837) (← links)
• Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy (Q5858999) (← links)
• Algorithms - ESA 2003 (Q5897290) (← links)
• On the minimum bisection of random 3-regular graphs (Q6106297) (← links)
• 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)