The critical node problem based on connectivity index and properties of components on trees (Q5012889)
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: The critical node problem based on connectivity index and properties of components on trees |
scientific article; zbMATH DE number 7434132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The critical node problem based on connectivity index and properties of components on trees |
scientific article; zbMATH DE number 7434132 |
Statements
The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (English)
0 references
26 November 2021
0 references
critical node problem
0 references
tree
0 references
dynamic programming
0 references
connectivity index
0 references
0 references
0.9024084210395812
0 references
0.8351931571960449
0 references
0.8306999802589417
0 references
0.8269613981246948
0 references
