no code implementations • 3 Feb 2021 • Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
For a given PICOD problem represented by a hypergraph consisting of messages as vertices and request-sets as hyperedges, we present achievable PICOD schemes using conflict-free colorings of the PICOD hypergraph.
Information Theory Discrete Mathematics Combinatorics Information Theory
no code implementations • 4 Dec 2018 • Suman Banerjee, Rogers Mathew, Fahad Panolan
We have the following results on the TSS problem: -> It was shown by Nichterlein et al. [Social Network Analysis and Mining, 2013] that it is possible to compute an optimal-sized target set in $O(2^{(2^{t}+1)t}\cdot m)$ time, where $t$ denotes the cardinality of a minimum degree-$0$ modulator of $G$.
Computational Complexity Data Structures and Algorithms Social and Information Networks 68W25, 68Q17, 68R10,
