A linear algorithm for the neighbor-component order connectivity of arbitrary trees (Q6542929)
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: A linear algorithm for the neighbor-component order connectivity of arbitrary trees |
scientific article; zbMATH DE number 7852482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear algorithm for the neighbor-component order connectivity of arbitrary trees |
scientific article; zbMATH DE number 7852482 |
Statements
A linear algorithm for the neighbor-component order connectivity of arbitrary trees (English)
0 references
23 May 2024
0 references
neighbor-component order connectivity
0 references
domination
0 references
component order connectivity
0 references
neighbor-connectivity
0 references
tree algorithm
0 references
complexity
0 references
0.8317320346832275
0 references
0.734476625919342
0 references
0.7167253494262695
0 references
