A linear algorithm to decompose inheritance graphs into modules
- 1 June 1995
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 13 (6) , 573-591
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A linear algorithm to decompose inheritance graphs into modulesAlgorithmica, 1995
- The number of depth-first searches of an ordered setOrder, 1989
- Efficient implementation of lattice operationsACM Transactions on Programming Languages and Systems, 1989
- Area requirement and symmetry display in drawing graphs1989
- The Calculation of Invariants for Ordered Sets1989
- Incremental modular decompositionJournal of the ACM, 1989
- The Common Lisp Object System: An Overview1987
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- Nombre de sauts et graphes série-parallèlesRAIRO. Informatique théorique, 1979
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972