A linear algorithm to decompose inheritance graphs into modules
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[2] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] Michel Habib,et al. On the X-join decomposition for undirected graphs , 1979, Discret. Appl. Math..
[5] Michel Habib,et al. Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..
[6] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..
[7] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..
[8] Linda G. DeMichiel,et al. The Common Lisp Object System: An Overview , 1987, ECOOP.
[9] Jeremy P. Spinrad,et al. Incremental modular decomposition , 1989, JACM.
[10] W. Trotter,et al. The number of depth-first searches of an ordered set , 1989 .
[11] Ioannis G. Tollis,et al. Area requirement and symmetry display in drawing graphs , 1989, SCG '89.
[12] Patrick Lincoln,et al. Efficient implementation of lattice operations , 1989, TOPL.
[13] M. Habib,et al. The Calculation of Invariants for Ordered Sets , 1989 .
[14] Peter Wegner,et al. Concepts and paradigms of object-oriented programming , 1990, OOPS.
[15] Jeremy P. Spinrad,et al. P4-Trees and Substitution Decomposition , 1992, Discret. Appl. Math..