Pages that link to "Item:Q534565"
From MaRDI portal
The following pages link to Improved deterministic algorithms for weighted matching and packing problems (Q534565):
Displaying 4 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
