Network generation using the Prufer code (Q1088882): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(86)90075-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985996025 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network generation using the Prufer code |
scientific article |
Statements
Network generation using the Prufer code (English)
0 references
1986
0 references
This paper describes the development and implementation of an interactive program for generation of generalized (e.g. maximum flow, minimum cost flow, shortest path), tripartite (i.e. transshipment) and bipartite (i.e. transportation and assignment) network problems. The generator is based on the Prufer code which is a numeric code that uniquely characterizes a tree. It has been implemented in BASIC on the IBM PC and makes extensive use of data structures and subroutines in order to promote modularity.
0 references
interactive program
0 references
maximum flow
0 references
shortest path
0 references
tripartite
0 references
transshipment
0 references
bipartite
0 references
transportation
0 references
assignment
0 references
Prufer code
0 references
