Encapsulation theory: the transformation equations of absolute information hiding

Simple item page
dc.creatorKirwan, Edmund
dc.date2009-01-14
dc.date.accessioned2026-07-07T12:29:33Z
dc.date.available2026-07-07T12:29:33Z
dc.descriptionThis paper describes how the maximum potential number of edges of an encapsulated graph varies as the graph is transformed, that is, as nodes are created and modified. The equations governing these changes of maximum potential number of edges caused by the transformations are derived and briefly analysed.
dc.description31 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/0901.2069
dc.identifierhttp://arxiv.org/abs/0901.2069
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215915
dc.subjectSoftware Engineering
dc.titleEncapsulation theory: the transformation equations of absolute information hiding
dc.typetext

Files

Collections

arXiv