Pages that link to "Item:Q2643810"
From MaRDI portal
The following pages link to The stable set problem and the thinness of a graph (Q2643810):
Displaying 15 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Thinness of product graphs (Q831864) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Heuristic manipulation, tabu search and frequency assignment (Q1038293) (← links)
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
