Pages that link to "Item:Q1000970"
From MaRDI portal
The following pages link to The labeled maximum matching problem (Q1000970):
Displaying 10 items.
- On the complexity of rainbow spanning forest problem (Q1749772) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- Maximum matchings of a digraph based on the largest geometric multiplicity (Q1793197) (← links)
- The rainbow spanning forest problem (Q1797922) (← links)
- Uncertain vertex coloring problem (Q2001167) (← links)
- Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
