1 citations · 1 across the 7 of their papers we have counts for
9 papers
Counting Triangles in Graph Streams with Repeatable and Forgettable Edges
Sourav Chakraborty, Debarshi Chanda, Arijit Ghosh +3
Most existing graph streaming algorithms assume the ideal scenario where each edge arrives only once. Real-world graph streams, such as communication or transaction logs, often con…
Constructing Long Paths in Graph Streams
Christian Konrad, Chhaya Trehan
In the graph stream model of computation, an algorithm processes the edges of an input graph in one or more sequential passes while using a memory sublinear in the input size. This…
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
Michael Elkin, Chhaya Trehan
Given an -vertex -edge digraph and a subset of (for some ) designated sources, the reachability problem is…
Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
Michael Elkin, Chhaya Trehan
Given an -vertex -edge digraph and a set , (for some ) of designated sources, the -direachability problem is to…
A Distributed Conductance Tester Without Global Information Collection
Tugkan Batu, Amitabh Trehan, Chhaya Trehan
We propose a simple and time-optimal algorithm for property testing a graph for its conductance in the CONGEST model. Our algorithm takes only rounds of communication (…
When you come at the kings you best not miss
Oded Lachish, Felix Reidl, Chhaya Trehan
A tournament is an orientation of a complete graph. We say that a vertex in a tournament controls another vertex if there exists a directed path of length at most…
-Approximate Shortest Paths in Dynamic Streams
Michael Elkin, Chhaya Trehan
Computing approximate shortest paths in the dynamic streaming setting is a fundamental challenge that has been intensively studied during the last decade. Currently existing soluti…
Energy Optimization of Memory Intensive Parallel workloads
Chhaya Trehan, Hans Vandierendonck, Georgios Karakonstantis +1
Energy consumption is an important concern in modern multicore processors. The energy consumed during the execution of an application can be minimized by tuning the hardware state…
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree
Shay Kutten, Chhaya Trehan
We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS…