Pages that link to "Item:Q3706869"
From MaRDI portal
The following pages link to An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869):
Displayed 6 items.
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- The point-to-point connection problem - analysis and algorithms (Q1377667) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Capacity-preserving subgraphs of directed flow networks (Q6182901) (← links)