z-logo
open-access-imgOpen Access
The b-Matching problem in distance-hereditary graphs and beyond
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.122
Subject(s) - combinatorics , treewidth , bounded function , chordal graph , mathematics , cardinality (data modeling) , matching (statistics) , discrete mathematics , indifference graph , pathwidth , bipartite graph , computer science , graph , line graph , statistics , mathematical analysis , data mining

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here