Maximum path digraphs (Q1327208)
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: Maximum path digraphs |
scientific article; zbMATH DE number 590186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum path digraphs |
scientific article; zbMATH DE number 590186 |
Statements
Maximum path digraphs (English)
0 references
15 June 1994
0 references
The number of paths between two vertices is of interest in the analysis of algorithms in which the number of computations depends on the number of paths in a corresponding digraph. The authors solve the problem of constructing a digraph with exactly one source \(s\) and exactly one sink \(t\) and, for fixed \(n\), exactly \(n\) arcs such that the number of paths from \(s\) to \(t\) is maximum.
0 references
paths
0 references
digraph
0 references
number
0 references
