The following pages link to An NP-complete matching problem (Q1166935):
Displaying 4 items.
- On complexity of special maximum matchings constructing (Q952636) (← links)
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
