Open AccessThe use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
Author(s) -
Guillaume Ducoffe,
Alexandru Popa
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.4230/lipics.isaac.2018.144
Subject(s) - quotient , bounded function , matching (statistics) , modular design , vertex (graph theory) , combinatorics , graph , mathematics , computer science , modular decomposition , algorithm , discrete mathematics , line graph , pathwidth , statistics , mathematical analysis , operating system