Recognizing strict 2-threshold graphs in O(m) time (Q673666)
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 985694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing strict 2-threshold graphs in O(m) time |
scientific article; zbMATH DE number 985694 |
Statements
Recognizing strict 2-threshold graphs in O(m) time (English)
0 references
28 February 1997
0 references
Algorithms
0 references
Recognition algorithms
0 references
Threshold graphs
0 references
Threshold number
0 references
0 references
0.8688760995864868
0 references
0.8222362399101257
0 references
0.7807450890541077
0 references
0.7795916199684143
0 references
0.7679879069328308
0 references
