Back to Search
Start Over
Linear algorithm for minimal rearrangement of structures.
- Source :
-
Problems of Information Transmission . Jan2017, Vol. 53 Issue 1, p55-72. 18p. - Publication Year :
- 2017
-
Abstract
- We propose a linear time and linear space algorithm which constructs a minimal sequence of operations rearranging one structure (directed graph of cycles and paths) into another. Structures in such a sequence may have a varying number of edges; a list of operations is fixed and includes deletion and insertion of a fragment of a structure. We give a complete proof that the algorithm is correct, i.e., finds the corresponding minimum. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00329460
- Volume :
- 53
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Problems of Information Transmission
- Publication Type :
- Academic Journal
- Accession number :
- 122634823
- Full Text :
- https://doi.org/10.1134/S0032946017010057