A linear algorithm to decompose inheritance graphs into modules
type: Item
instance of: scholarly article
title: A linear algorithm to decompose inheritance graphs into modules
zbMATH Open document ID: 0826.68096
DOI: 10.1007/BF01189070
author: Yanyan Li
published in: Algorithmica
publication date: 1995-06-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 765172
zbMATH Keywords: inheritance graphs
zbMATH Keywords: object-oriented languages
zbMATH Keywords: linear-time complexity algorithm
describes a project that uses: CLOS
MaRDI profile type: Publication
cites work: The Transitive Reduction of a Directed Graph
cites work: Q4065051
cites work: Q4200070
cites work: Area requirement and symmetry display of planar upward drawings
cites work: Q3823821
cites work: On the X-join decomposition for undirected graphs
cites work: The number of depth-first searches of an ordered set
cites work: Incremental modular decomposition
cites work: \(P_ 4\)-trees and substitution decomposition
cites work: Depth-First Search and Linear Graph Algorithms
cites work: The Recognition of Series Parallel Digraphs
description: scientific article; zbMATH DE number 765172