Open AccessMaximum Matching in almost linear time on graphs of bounded clique-width
Author(s) -
Guillaume Ducoffe
Publication year - 2021
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.4230/lipics.ipec.2021.15
Subject(s) - matching (statistics) , bounded function , clique , combinatorics , treewidth , mathematics , time complexity , discrete mathematics , computer science , graph , pathwidth , statistics , mathematical analysis , line graph