3268 search results - page 187 / 654 » The hub number of a graph |
196
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...
216
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...
205
click to vote
SIAMDM
2010
15 years 4 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...
174
click to vote
IV
2005
IEEE
16 years 3 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...
188
click to vote
WADS
2005
Springer
16 years 12 hour ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...