Keywords: Structural analysis; BLT; reduced-order models
Proceedings of the 8th International Modelica Conference; March 20th-22nd; Technical Univeristy; Dresden; Germany
[1] J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica; 15(6):521–549; 1996. doi: 10.1007/BF01940880.
[2] T.H. Cormen; C.E. Leiserson; R.L. Rivest; and C. Stein. Introduction to Algorithms; chapter 22; pages 527–529. MIT Press and McGraw-Hill; second edition; 2001.
[3] J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM (JACM); 19(2):248–264; 1972. doi: 10.1145/321694.321699.
[4] A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM (JACM); 35(4):921–940; 1988. doi: 10.1145/48014.61051.
[5] R.S. Kosaraju. Unpublished; 1978.
[6] R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing; 1:146; 1972. doi: 10.1137/0201010.