Complexity results for generating subgraphs (Q724239)
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: Complexity results for generating subgraphs |
scientific article; zbMATH DE number 6910236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for generating subgraphs |
scientific article; zbMATH DE number 6910236 |
Statements
Complexity results for generating subgraphs (English)
0 references
25 July 2018
0 references
weighted well-covered graph
0 references
maximal independent set
0 references
relating edge
0 references
generating subgraph
0 references
vector space
0 references
0.9134872555732728
0 references
0.8448401093482971
0 references
0.8315845727920532
0 references
0.7979243993759155
0 references
