Pages that link to "Item:Q4201383"
From MaRDI portal
The following pages link to On sparse subgraphs preserving connectivity properties (Q4201383):
Displaying 19 items.
- A note on minimizing submodular functions (Q293366) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Sparse connectivity certificates via MA orderings in graphs (Q860401) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- Sparse graph certificates for mixed connectivity (Q1781979) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree (Q1906850) (← links)
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs (Q2488209) (← links)
- Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (Q5101432) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)
- On mixed connectivity certificates (Q6102287) (← links)
