Pages that link to "Item:Q1748508"
From MaRDI portal
The following pages link to A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508):
Displaying 5 items.
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- On the bond polytope (Q6060889) (← links)