4171 search results - page 214 / 835 » Choice numbers of graphs |
170
click to vote
RSA
2011
15 years 1 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
201
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
218
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
210
click to vote
SIAMDM
2010
15 years 5 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
176
click to vote
IV
2005
IEEE
16 years 7 days ago
2005
IEEE
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...