4171 search results - page 160 / 835 » Choice numbers of graphs |
157
click to vote
JGT
2008
15 years 6 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
175
click to vote
ISSTA
2004
ACM
16 years 3 hour ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
166
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
147
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
154
click to vote
MFCS
2007
Springer
16 years 21 days ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...