Pages that link to "Item:Q5929142"
From MaRDI portal
The following pages link to A probabilistic result for the max-cut problem on random graphs (Q5929142):
Displaying 5 items.
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs (Q1842649) (← links)
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model (Q2031482) (← links)
- Extremal cuts of sparse random graphs (Q2412669) (← links)
- The cut metric, random graphs, and branching processes (Q5961848) (← links)