Pages that link to "Item:Q931729"
From MaRDI portal
The following pages link to Approximation of satisfactory bisection problems (Q931729):
Displaying 10 items.
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Complexity of the bisection method (Q2381525) (← links)
- A polylogarithmic approximation of the minimum bisection (Q2784494) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- Average-Case Optimality of a Hybrid Secant-Bisection Method (Q4878510) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)