Pages that link to "Item:Q3786300"
From MaRDI portal
The following pages link to On multiple steiner subgraph problems (Q3786300):
Displaying 10 items.
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- An effective genetic algorithm for network coding (Q1762065) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Placing Green bridges optimally, with a multivariate analysis (Q2117784) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)
