A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph (Q5301401)
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 New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph |
scientific article; zbMATH DE number 5493570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph |
scientific article; zbMATH DE number 5493570 |
Statements
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph (English)
0 references
19 January 2009
0 references
undirected graph
0 references
deadlock-free wormhole routing
0 references
0.88635314
0 references
0 references
0 references
0.88249683
0 references
0 references
0.87661564
0 references
0.87287605
0 references
