The following pages link to Covering a graph with cycles. (Q1406651):
Displaying 9 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- Shipper collaboration (Q858256) (← links)
- A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
- Typical circulant double coverings of a circulant graph. (Q1426111) (← links)
- An optimal strategy for the Constrained Cycle Cover Problem (Q1601929) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- The bounded cycle-cover problem (Q2884498) (← links)
- Covering a graph with cycles passing through given edges (Q4362093) (← links)
- Covering a graph with cycles (Q4852405) (← links)