An algebraic approach for finding disjoint paths in the alternating group graph (Q3507253)
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: An algebraic approach for finding disjoint paths in the alternating group graph |
scientific article; zbMATH DE number 5289562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algebraic approach for finding disjoint paths in the alternating group graph |
scientific article; zbMATH DE number 5289562 |
Statements
18 June 2008
0 references
interconnection networks
0 references
graphs
0 references
vertex disjoint paths
0 references
large scale computing
0 references
alternating group graph
0 references
disjoint path property
0 references
algebraic algorithm
0 references
Cayley graphs
0 references
0.8783987164497375
0 references
0.8693529963493347
0 references
0.8447684049606323
0 references
0.8230895400047302
0 references
0.7940959930419922
0 references
