723 search results - page 56 / 145 » On the hyperbolicity constant in graphs |
200
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
172
click to vote
UAI
2004
15 years 7 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
136
click to vote
CCCG
2009
15 years 7 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
186
click to vote
JCT
2010
15 years 4 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
134
click to vote
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...