dnf model counting 1klee's measure problem 1set coverage 1streaming algorithms 1union size estimation 1
From the 1 of 21 papers with an AI index.
6 citations
- Ben-Gurion University of the NegevIL2 papers
- Jamia Millia IslamiaIN2 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- S.N. Bose National Centre for Basic SciencesIN2 papers
- University of LeedsGB2 papers
- Centre for Research in Astrophysics of QuébecCA1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Design Science (United Kingdom)GB1 paper
- Durban University of TechnologyZA1 paper
- Harish-Chandra Research InstituteIN1 paper
- Indian Institute of Technology GoaIN1 paper
- Indian Institute of Technology JammuIN1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026★ 6 cited
Estimating Size of the Union of Sets in Streaming Model
Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty
The paper presents a simple sampling-based streaming algorithm that approximates the size of the union of implicitly given sets, achieving provable space and update‑time bounds and…
cs.DS2026
Algorithms and complexity for geodetic sets on interval and chordal graphs
Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2
We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set of vertices of a graph is a \textit{geodetic se…