1736 search results - page 271 / 348 » The rank-width of Directed Graphs |
136
Voted
SODA
1992
ACM
15 years 5 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
137
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
160
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
172
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
146
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...