4865 search results - page 362 / 973 » The Complexity of Graph Connectivity |
205
Voted
PDP
2005
IEEE
16 years 10 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
217
click to vote
SPIRE
2005
Springer
16 years 7 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
171
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
170
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
142
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...