Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5916987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width |
scientific article; zbMATH DE number 5916987 |
Statements
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (English)
0 references
1 July 2011
0 references
maximal matching
0 references
path matching
0 references
counting
0 references
clique-width
0 references
0.9324361
0 references
0.90751266
0 references
0 references
0.8933529
0 references
0 references
0.88603014
0 references
0.88549197
0 references
0.88481283
0 references
0.8841789
0 references
