Efficient computation of the characteristic polynomial of a threshold graph (Q3452551)
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 6508048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of the characteristic polynomial of a threshold graph |
scientific article; zbMATH DE number 6508048 |
Statements
Efficient Computation of the Characteristic Polynomial of a Threshold Graph (English)
0 references
12 November 2015
0 references
efficient algorithms
0 references
threshold graphs
0 references
characteristic polynomial
0 references
0 references
0.988469123840332
0 references
0.9137247800827026
0 references
0.9097530841827391
0 references
0.8067062497138977
0 references
0.8003324866294861
0 references
