Sciweavers

524 search results - page 90 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
CIBCB
2007
IEEE
14 years 1 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
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...
DM
2007
83views more  DM 2007»
13 years 7 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
IPL
2007
87views more  IPL 2007»
13 years 7 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»
13 years 7 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...