1729 search results - page 111 / 346 » On Bounds for the k-Partitioning of Graphs |
COMSNETS
2012
13 years 5 months ago
2012
—Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glanc...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
SIROCCO
2010
14 years 11 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
100
click to vote
JGAA
2008
14 years 10 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...