3757 search results - page 169 / 752 » The overlap number of a graph |
151
click to vote
SIROCCO
2007
15 years 7 months ago
2007
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
172
click to vote
DAM
2010
15 years 6 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
156
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...
152
click to vote
LCN
2006
IEEE
16 years 13 days ago
2006
IEEE
We introduce a scalable algorithm for time-parallel simulations of wireless ad hoc networks and report on our results. Our approach decomposes the simulation into overlapping temp...
152
click to vote
MFCS
2007
Springer
16 years 17 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...