3471 search results - page 184 / 695 » Obstacle Numbers of Graphs |
122
click to vote
LCN
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
145
click to vote
ANOR
2005
15 years 4 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
156
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
135
click to vote
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we propose a long-term motion model for visual object tracking. In crowded street scenes, persistent occlusions are a frequent challenge for tracking algorithm and ...
141
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...