Pages that link to "Item:Q2492214"
From MaRDI portal
The following pages link to A combinatorial algorithm for weighted stable sets in bipartite graphs (Q2492214):
Displaying 14 items.
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
- Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
- (Q3002403) (← links)
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS (Q4366150) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
- Variational approximations in geoadditive latent Gaussian regression: mean and quantile regression (Q5963823) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Bisimplicial separators (Q6565812) (← links)