Pages that link to "Item:Q1186788"
From MaRDI portal
The following pages link to A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph (Q1186788):
Displaying 50 items.
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Certifying algorithms (Q465678) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Minimum degree orderings (Q848936) (← links)
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392) (← links)
- Sparse connectivity certificates via MA orderings in graphs (Q860401) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Sparse graph certificates for mixed connectivity (Q1781979) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- Compact cactus representations of all non-trivial min-cuts (Q1983141) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Optimal per-edge processing times in the semi-streaming model (Q2380006) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326) (← links)
- On the decay of crossing numbers (Q2464150) (← links)
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs (Q2488209) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS (Q2929622) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
