Zobrazeno 1 - 10
of 30
pro vyhledávání: '"BERA, SUMAN K."'
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically seeing only a small portion of it. This model, known as the random walk
Externí odkaz:
http://arxiv.org/abs/2212.03957
Computing a dense subgraph is a fundamental problem in graph mining, with a diverse set of applications ranging from electronic commerce to community detection in social networks. In many of these applications, the underlying context is better modell
Externí odkaz:
http://arxiv.org/abs/2204.08106
Counting homomorphisms of a constant sized pattern graph $H$ in an input graph $G$ is a fundamental computational problem. There is a rich history of studying the complexity of this problem, under various constraints on the input $G$ and the pattern
Externí odkaz:
http://arxiv.org/abs/2010.08083
We consider the problem of counting the number of copies of a fixed graph $H$ within an input graph $G$. This is one of the most well-studied algorithmic graph problems, with many theoretical and practical applications. We focus on solving this probl
Externí odkaz:
http://arxiv.org/abs/2010.05998
In this paper, we initiate the study of fair clustering that ensures distributional similarity among similar individuals. In response to improving fairness in machine learning, recent papers have investigated fairness in clustering algorithms and hav
Externí odkaz:
http://arxiv.org/abs/2006.12589
Autor:
Bera, Suman K., Seshadhri, C.
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these algorithms require reading the whole input graph. In many scenarios,
Externí odkaz:
http://arxiv.org/abs/2006.11947
Autor:
Bera, Suman K., Seshadhri, C.
We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of $m$ edges, our aim is to compute a $(1\pm\varepsilon)$-approximation to the triangle count $T$, using a small space algorithm.
Externí odkaz:
http://arxiv.org/abs/2003.13151
We consider the problem of counting all $k$-vertex subgraphs in an input graph, for any constant $k$. This problem (denoted sub-cnt$_k$) has been studied extensively in both theory and practice. In a classic result, Chiba and Nishizeki (SICOMP 85) ga
Externí odkaz:
http://arxiv.org/abs/1911.05896
We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big data. These include the data streaming model, the general graph query model, the massively parallel computation (M
Externí odkaz:
http://arxiv.org/abs/1905.00566
Autor:
BERA, SUMAN K.1 sumankalyanbera@gmail.com, GISHBOLINER, LIOR2 liorgis1@mail.tau.ac.il, LEVANZOV, YEVGENY2 yevgenylasafico@mail.tau.ac.il, SESHADHRI, C.1 sesh@ucsc.edu, SHAPIRA, ASAF2
Publikováno v:
Journal of the ACM. May2022, Vol. 69 Issue 3, p1-21. 21p.
