553 search results - page 12 / 111 » Cover Contact Graphs |
70
Voted
ICCV
2007
IEEE
16 years 2 days ago
2007
IEEE
Electric chronic stimulation of the human motor cortex (ECSM) has been reported to alleviate chronic severe pain. However the mechanism of action of ECSM is still hypothetical. Th...
ALGORITHMICA
2010
14 years 10 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
ALGORITHMICA
2005
14 years 10 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
DM
2008
14 years 10 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...