3204 search results - page 459 / 641 » The b-chromatic Number of a Graph |
175
click to vote
FOSSACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
159
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
231
click to vote
SPRINGSIM
2010
15 years 5 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
209
click to vote
IMCSIT
2010
15 years 4 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
185
click to vote
TCS
2010
15 years 5 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...