Efficient computation of the characteristic polynomial of a threshold graph (Q507427)
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 6680868
| 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 6680868 |
Statements
Efficient computation of the characteristic polynomial of a threshold graph (English)
0 references
6 February 2017
0 references
efficient algorithms
0 references
threshold graphs
0 references
characteristic polynomial
0 references
0 references
0.988469123840332
0 references
0.9072378873825072
0 references
0.8966085314750671
0 references
0.8050894141197205
0 references
0.7925246357917786
0 references
