In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
This paper proposes an approach to comparison of spatial hypertext collections which avoids becoming entangled in complexities of version management and merging. We also propose a...
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Vertical standards are complex networked technologies whose assimilation is subject to extensive interorganizational dependence and network effects. Classical theories of diffusio...
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....