The complexity of some graph problems with bounded minors of their constraint matrices (Q5884490)
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 7667277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of some graph problems with bounded minors of their constraint matrices |
scientific article; zbMATH DE number 7667277 |
Statements
23 March 2023
0 references
Boolean linear programming
0 references
independent set problem
0 references
dominating set problem
0 references
matrix minor
0 references
polynomial-time algorithm
0 references
0.8826945424079895
0 references
0.8626802563667297
0 references
0.8182629346847534
0 references
