Pages that link to "Item:Q3754451"
From MaRDI portal
The following pages link to Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451):
Displayed 13 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- Complexity results for the \(p\)-median problem with mutual communication (Q1317006) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- An optimal algorithm for an outerplanar facility location problem with improved time complexity (Q2424182) (← links)
- On the connectedness property of service areas for the Network Facility Location Problem (Q3438964) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- Complexity of finding a join of maximum weight (Q5954077) (← links)