1986 search results - page 220 / 398 » Path Separability of Graphs |
115
click to vote
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
146
click to vote
DM
2000
15 years 2 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
116
click to vote
ECCC
2006
15 years 2 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
126
click to vote
MOBIHOC
2005
ACM
16 years 2 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
115
click to vote
PAMI
2007
15 years 2 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...