An optimal algorithm for the maximum alignment of terminals
- 15 February 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 20 (2) , 75-82
- https://doi.org/10.1016/0020-0190(85)90067-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Maximizing pin alignment by pin permutationsIntegration, 1984
- Optimal Wiring of Movable TerminalsIEEE Transactions on Computers, 1983
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972