Pages that link to "Item:Q2450758"
From MaRDI portal
The following pages link to Critical edges for the assignment problem: complexity and exact resolution (Q2450758):
Displaying 8 items.
- Connectivity interdiction (Q1785279) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Blocking total dominating sets via edge contractions (Q2034793) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- (Q5092403) (← links)
