Sciweavers

131 search results - page 1 / 27
» Hypergraphs with independent neighborhoods
Sort
View
COMBINATORICA
2010
13 years 8 months ago
Hypergraphs with independent neighborhoods
For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We pro...
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pik...
JCT
2011
101views more  JCT 2011»
13 years 5 months ago
Almost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
József Balogh, Dhruv Mubayi
IPL
2006
105views more  IPL 2006»
13 years 11 months ago
Finding and counting cliques and independent sets in r-uniform hypergraphs
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
Raphael Yuster
ICAPR
2005
Springer
14 years 4 months ago
Weighted Adaptive Neighborhood Hypergraph Partitioning for Image Segmentation
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
Soufiane Rital, Hocine Cherifi, Serge Miguet
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
14 years 4 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet