On the minimum driver node set of \(k\)-uniform linear hypertree networks (Q6585541)
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: On the minimum driver node set of k-uniform linear hypertree networks |
scientific article; zbMATH DE number 7894928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum driver node set of \(k\)-uniform linear hypertree networks |
scientific article; zbMATH DE number 7894928 |
Statements
On the minimum driver node set of \(k\)-uniform linear hypertree networks (English)
0 references
12 August 2024
0 references
uniform hypernetwork
0 references
exact controllability
0 references
2-section graph
0 references
minimum driver node set
0 references
algorithm
0 references
0.817116916179657
0 references
0.8123034238815308
0 references
0.8072474002838135
0 references
0.7822540998458862
0 references
