Pages that link to "Item:Q644513"
From MaRDI portal
The following pages link to Russian doll search for the Steiner triple covering problem (Q644513):
Displaying 6 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
