Computing well-covered vector spaces of graphs using modular decomposition (Q6184796)
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 7784411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing well-covered vector spaces of graphs using modular decomposition |
scientific article; zbMATH DE number 7784411 |
Statements
Computing well-covered vector spaces of graphs using modular decomposition (English)
0 references
5 January 2024
0 references
weighted well-covered graph
0 references
well-covered vector space
0 references
modular decomposition
0 references
Gaussian elimination
0 references
fork-free graph
0 references
cograph
0 references
0 references
0 references
0 references
0.88314855
0 references
0.8803462
0 references
0.87396395
0 references
0.87213457
0 references
0 references
0 references
0.86995023
0 references
0.8692502
0 references
