Pages that link to "Item:Q2399617"
From MaRDI portal
The following pages link to Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617):
Displaying 8 items.
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- (Q3181058) (redirect page) (← links)
- (Q5111862) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- Slim tree-cut width (Q6586668) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)