Pages that link to "Item:Q686268"
From MaRDI portal
The following pages link to Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268):
Displaying 7 items.
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Constructive proof of deficiency theorem of \((g,f)\)-factor (Q989802) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors (Q3439567) (← links)
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (Q4033760) (← links)
- Integer Programming and Combinatorial Optimization (Q5712468) (← links)