A note on Winkler's algorithm for factoring a connected graph (Q686292)
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 428131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Winkler's algorithm for factoring a connected graph |
scientific article; zbMATH DE number 428131 |
Statements
A note on Winkler's algorithm for factoring a connected graph (English)
0 references
14 October 1993
0 references
Winkler's algorithm
0 references
connected graph
0 references
Cartesian product
0 references
prime factorization
0 references
0.7943596243858337
0 references
0.7766287922859192
0 references
0.7764536142349243
0 references
0.7745150923728943
0 references
0.7628395557403564
0 references
