Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1806.00791 / rank | |||
Normal rank | |||
Revision as of 12:02, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width |
scientific article |
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
