553 search results - page 17 / 111 » Cover Contact Graphs |
IPCO
2007
14 years 11 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
159
click to vote
ICITS
2011
14 years 1 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
95
Voted
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
FUZZIEEE
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...