Sciweavers

3757 search results - page 110 / 752
» The overlap number of a graph
Sort
View
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 1 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
ENDM
2010
127views more  ENDM 2010»
14 years 10 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
CANDC
2006
ACM
14 years 10 months ago
Identification of functional modules in a PPI network by clique percolation clustering
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
Shi-Hua Zhang, Xue-Mei Ning, Xiang-Sun Zhang
OPODIS
2007
14 years 11 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
14 years 8 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson