Pages that link to "Item:Q3989010"
From MaRDI portal
The following pages link to Computing Edge-Connectivity in Multigraphs and Capacitated Graphs (Q3989010):
Displaying 50 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- A note on minimizing submodular functions (Q293366) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- A network flow model of group technology (Q597530) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Minimum degree orderings (Q848936) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← 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)
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs (Q894472) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Submodular function minimization (Q995782) (← links)
- On computing a conditional edge-connectivity of a graph (Q1095928) (← links)
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph (Q1186788) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- A new and improved algorithm for the 3-cut problem (Q1267194) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- A clustering algorithm based on graph connectivity (Q1607070) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- On the (co)girth of a connected matroid (Q2462384) (← links)
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas (Q2629905) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
