A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product (Q4925263)
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: A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product |
scientific article; zbMATH DE number 6174178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product |
scientific article; zbMATH DE number 6174178 |
Statements
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product (English)
0 references
11 June 2013
0 references
0.917677104473114
0 references
0.8412976861000061
0 references
0.827806293964386
0 references
0.8022136688232422
0 references
0.8011577725410461
0 references
