721 search results - page 51 / 145 » Almost universal graphs |
142
click to vote
CDC
2010
IEEE
14 years 12 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
170
click to vote
SIAMDM
2010
15 years 3 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
115
click to vote
JCT
2007
15 years 4 months ago
2007
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
179
click to vote
CVPR
2009
IEEE
17 years 5 days ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
144
Voted
DEXA
2003
Springer
15 years 10 months ago
2003
Springer
In recent years, link-based information retrieval methods from the Web are developed. A framework of these methods is a Web graph using pages as vertices and Web-links as edges. In...