On the NP-completeness of the perfect matching free subgraph problem (Q418003)
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: On the NP-completeness of the perfect matching free subgraph problem |
scientific article; zbMATH DE number 6034857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the NP-completeness of the perfect matching free subgraph problem |
scientific article; zbMATH DE number 6034857 |
Statements
On the NP-completeness of the perfect matching free subgraph problem (English)
0 references
14 May 2012
0 references
bipartite graph
0 references
matching
0 references
blocker
0 references
stable set
0 references
tripartite graph
0 references
NP-complete
0 references
structural analysis problem
0 references
0.8122482895851135
0 references
0.7964325547218323
0 references
0.7735018134117126
0 references
0.771820068359375
0 references
0.7659143209457397
0 references
