An algorithm for optimum common root functions of two digraphs (Q688253)
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 algorithm for optimum common root functions of two digraphs |
scientific article; zbMATH DE number 444638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for optimum common root functions of two digraphs |
scientific article; zbMATH DE number 444638 |
Statements
An algorithm for optimum common root functions of two digraphs (English)
0 references
5 May 1994
0 references
finite digraphs
0 references
arborescences
0 references
covering
0 references
root function
0 references
polynomial algorithm
0 references
0.902033030986786
0 references
0.777323842048645
0 references
0.7761961817741394
0 references
0.766777515411377
0 references
