15 search results - page 2 / 3 » Hamiltonian Chains in Hypergraphs |
JGT
2008
13 years 5 months ago
2008
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...
JCT
2008
13 years 5 months ago
2008
JGT
2010
13 years 4 months ago
2010
IWOCA
2010
Springer
13 years 11 days ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
In this paper, we develop a neurobiologicallymotivated statistical method for video analysis that simultaneously searches the combined motion and form space in a concerted and efï...