Pages that link to "Item:Q5948962"
From MaRDI portal
The following pages link to Reload cost problems: Minimum diameter spanning tree (Q5948962):
Displayed 20 items.
- On minimum reload cost cycle cover (Q496639) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- The complexity of a minimum reload cost diameter problem (Q1003738) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- (Q5111862) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)