A linear algorithm to decompose inheritance graphs into modules

DOI10.1007/BF01189070zbMath0826.68096MaRDI QIDQ1892582

Yanyan Li

Publication date: 19 June 1995

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

object-oriented languagesinheritance graphslinear-time complexity algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (4)

A linear algorithm to decompose inheritance graphs into modules ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT ⋮ Graph decompositions definable in monadic second-order logic

Uses Software

• CLOS

Cites Work

• The number of depth-first searches of an ordered set
• On the X-join decomposition for undirected graphs
• Area requirement and symmetry display of planar upward drawings
• \(P_ 4\)-trees and substitution decomposition
• A linear algorithm to decompose inheritance graphs into modules
• Incremental modular decomposition
• The Recognition of Series Parallel Digraphs
• The Transitive Reduction of a Directed Graph
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear algorithm to decompose inheritance graphs into modules