We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...