3471 search results - page 232 / 695 » Obstacle Numbers of Graphs |
124
click to vote
CONEXT
2009
ACM
15 years 6 months ago
2009
ACM
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
156
click to vote
DM
2010
15 years 5 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
186
click to vote
MVA
2008
15 years 5 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
160
click to vote
SIAMDM
2008
15 years 5 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
157
click to vote
SIAMSC
2008
15 years 5 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...