Satgraphs and independent domination. I (Q818113)
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 5015089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satgraphs and independent domination. I |
scientific article; zbMATH DE number 5015089 |
Statements
Satgraphs and independent domination. I (English)
0 references
24 March 2006
0 references
satgraphs
0 references
satisfiability problem
0 references
hereditary class of graphs
0 references
forbidden induced subgraph characterization
0 references
independent domination problem
0 references
polar graphs
0 references
perfect graphs
0 references
NP-complete
0 references
polynomial-time algorithm
0 references
0.8566734790802002
0 references
0.8327664136886597
0 references
0.8225088119506836
0 references
0.787466824054718
0 references
0.7743042707443237
0 references
