The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes.

Guillaume Ducoffe, Alexandru Popa

Browse the full ISAAC paper archive.