A formal method for inheritance graph hierarchy construction

DOI10.1016/S0020-0255(01)00187-6zbMath1021.68637OpenAlexW2008653953MaRDI QIDQ1394885

Ibtissem Nafkha, Mohamed Mohsen Gammoudi

Publication date: 25 June 2003

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00187-6

zbMATH Keywords

ClassBinary relationConceptual schemaIncremental and rectangular decompositionInheritance graph hierarchyOptimal rectangle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) General topics in the theory of data (68P01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Basic Algorithms in Concept Analysis
• Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires

This page was built for publication: A formal method for inheritance graph hierarchy construction