Pages that link to "Item:Q2892302"
From MaRDI portal
The following pages link to Exact Algorithms for a Loading Problem with Bounded Clique Width (Q2892302):
Displayed 7 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Solution approaches for storage loading problems with stacking constraints (Q2027013) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)