Sciweavers

288 search results - page 44 / 58
» On the number of maximal independent sets in a graph
Sort
View
CIBCB
2007
IEEE
15 years 4 months ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
IPL
2007
87views more  IPL 2007»
14 years 9 months ago
The forwarding indices of augmented cubes
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
Min Xu, Jun-Ming Xu
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
14 years 9 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
ACSAC
2008
IEEE
15 years 4 months ago
The Role Hierarchy Mining Problem: Discovery of Optimal Role Hierarchies
Role hierarchies are fundamental to the role based access control (RBAC) model. The notion of role hierarchy is a well understood concept that allows senior roles to inherit the p...
Qi Guo, Jaideep Vaidya, Vijayalakshmi Atluri
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
15 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...