The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract) (Q5902513)
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 5655926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract) |
scientific article; zbMATH DE number 5655926 |
Statements
Graph-Theoretic Concepts in Computer Science (English)
0 references
12 January 2010
0 references
0.970065176486969
0 references
0.8562188148498535
0 references
0.8548294901847839
0 references
0.8489395380020142
0 references
