Pages that link to "Item:Q3936213"
From MaRDI portal
The following pages link to The complexity of restricted spanning tree problems (Q3936213):
Displayed 22 items.
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Optimizing over a slice of the bipartite matching polytope (Q1111947) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Corrigendum to ``The complexity of cubical graphs'' (Q1825039) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Cooperation in Multiorganization Matching (Q3602831) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- Balanced spanning forests and trees (Q3984286) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)
- (Q5708519) (← links)