Pages that link to "Item:Q4377121"
From MaRDI portal
The following pages link to Algorithms for Graphic Polymatroids and Parametrics-Sets (Q4377121):
Displaying 15 items.
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Globally rigid circuits of the direction-length rigidity matroid (Q968450) (← links)
- A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
- Improving graph partitions using submodular functions. (Q1410700) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Global rigidity of direction-length frameworks (Q2200920) (← links)
- Network reinforcement (Q2583121) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- A linear programming approach to increasing the weight of all minimum spanning trees (Q3548723) (← links)
- The Minimum Weight In-Tree Cover Problem (Q3627688) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
