๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A linear algorithm to decompose inheritance graphs into modules

โœ Scribed by M. Habib; M. Huchard; J. Spinrad

Publisher
Springer
Year
1995
Tongue
English
Weight
886 KB
Volume
13
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm to convert graphs into EDNF
An algorithm to convert graphs into EDNF
โœ Ali A. Khan; Mansoor Al-A'ali; Nigat R. Alam ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 465 KB
A linear time algorithm to recognize cir
A linear time algorithm to recognize circular permutation graphs
โœ Sritharan, R. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea