2432 search results - page 80 / 487 » Degrees and choice numbers |
166
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
167
click to vote
IJON
2007
15 years 6 months ago
2007
A common approach to measure and assess cortical dynamics focuses on the analysis of mass signals, such as the local field potential (LFP), as an indicator for the underlying net...
155
click to vote
CMC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this chapter we report on an investigation into the principles underlying the choice of a particular referential expression to refer to an object located in a domain t...
155
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
190
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...