1632 search results - page 15 / 327 » On special numberings of hypergraphs |
170
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
190
click to vote
MMSEC
2006
ACM
15 years 12 months ago
2006
ACM
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...
126
click to vote
JCT
2007
15 years 5 months ago
2007
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
393
click to vote
IWOCA
2010
Springer
15 years 25 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...
200
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...