Pages that link to "Item:Q3521942"
From MaRDI portal
The following pages link to The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (Q3521942):
Displaying 4 items.
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- (Q5743478) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)