Pages that link to "Item:Q4170253"
From MaRDI portal
The following pages link to Some Matching Problems for Bipartite Graphs (Q4170253):
Displayed 17 items.
- A theory of rectangular dual graphs (Q923112) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- Degree switching operations in networks and large scale systems assignment problems (Q1139029) (← links)
- An NP-complete matching problem (Q1166935) (← links)
- Coloured matchings in bipartite graphs (Q1357740) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Path colorings in bipartite graphs (Q1767676) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- Self-organized Anonymous Authentication in Mobile Ad Hoc Networks (Q3556628) (← links)
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
- (Q4520238) (← links)