Pages that link to "Item:Q5385038"
From MaRDI portal
The following pages link to APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385038):
Displaying 5 items.
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Eulerian detachments with local edge-connectivity (Q1028462) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Some Theorems on Detachments Preserving Local-Edge-Connectivity (Q3439432) (← links)
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs (Q3989010) (← links)