Maximum induced matching problem on hhd-free graphs (Q765362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum induced matching problem on hhd-free graphs |
scientific article; zbMATH DE number 6015803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum induced matching problem on hhd-free graphs |
scientific article; zbMATH DE number 6015803 |
Statements
Maximum induced matching problem on hhd-free graphs (English)
0 references
19 March 2012
0 references
algorithm
0 references
induced matching
0 references
chordal
0 references
hhd-free
0 references
0 references
0.9223905
0 references
0.9223905
0 references
0.9109262
0 references
0.90979207
0 references
0.90033114
0 references
0 references
0.8881234
0 references
0.8877718
0 references
0.88718116
0 references
