Hypergraphs and intervals
نویسندگان
چکیده
منابع مشابه
Mining Strongly Correlated Intervals with Hypergraphs
Correlation is an important statistical measure for estimating dependencies between numerical attributes in multivariate datasets. Previous correlation discovery algorithms mostly dedicate to find piecewise correlations between the attributes. Other research efforts, such as correlation preserving discretization, can find strongly correlated intervals through a discretization process while pres...
متن کاملdecomposing hypergraphs into k-colorable hypergraphs
for a given hypergraph $h$ with chromatic number $chi(h)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${e_1,e_2,ldots,e_l}$ for $e(h)$, such that the hypergraph induced by $e_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(h) rceil$.
متن کاملCyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
A cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form {F, F , F θ 2 , . . . , F θ q−1 } for some permutation θ of the vertex set V . Let Vn = {1, 2, . . . , n}. For a positive integer k, ( Vn k ) denotes the set of all k-subsets of Vn. For a nonempty subset K of Vn−1, we let K n denote the hypergraph ( Vn, ⋃ k∈K ( Vn k )) . In this paper, we find a necessary an...
متن کاملDirected hypergraphs: A tool for researching digraphs and hypergraphs
In this paper we introduce the concept of directed hypergraph. It is a generalisation of the concept of digraph and is closely related with hypergraphs. The basic idea is to take a hypergraph, partition its edges non-trivially (when possible), and give a total order to such partitions. The elements of these partitions are called levels. In order to preserve the structure of the underlying hyper...
متن کاملNon-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs
Firstly, this paper proposes a non-uniform evolving hypergraph model with nonlinear preferential attachment and an attractiveness. This model allows nodes to arrive in batches according to a Poisson process and to form hyperedges with existing batches of nodes. Both the number of arriving nodes and that of chosen existing nodes are random variables so that the size of each hyperedge is non-unif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1981
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1981.101761