Pages that link to "Item:Q414633"
From MaRDI portal
The following pages link to An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633):
Displaying 13 items.
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- Two disjoint shortest paths problem with non-negative edge length (Q2294269) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
- On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
