Antipodal turiyam neutrosophic graphs
T Fujita, F Smarandache - Neutrosophic Optimization and …, 2025 - sciencesforce.com
Graph theory, a mathematical field, investigates the relationships between entities through
vertices and edges [29]. Within this discipline, Uncertain Graph Theory emerges to model …
vertices and edges [29]. Within this discipline, Uncertain Graph Theory emerges to model …
Almost Tight Bounds for Differentially Private Densest Subgraph
Abstract We study the Densest Subgraph (DSG) problem under the additional constraint of
differential privacy. DSG is a fundamental theoretical question that plays a central role in …
differential privacy. DSG is a fundamental theoretical question that plays a central role in …
Improved Differentially Private Densest Subgraph: Local and Purely Additive
M Dinitz, S Kale, S Lattanzi, S Vassilvitskii - ar** Probability for Differential Private Sign Random Projection Methods
We develop a series of differential privacy (DP) algorithms from a family of random
projection (RP) and sign random projection (SignRP) methods. We first show how to …
projection (RP) and sign random projection (SignRP) methods. We first show how to …
k-median clustering via metric embedding: towards better initialization with differential privacy
In clustering algorithms, the choice of initial centers is crucial for the quality of the learned
clusters. We propose a new initialization scheme for the $ k $-median problem in the …
clusters. We propose a new initialization scheme for the $ k $-median problem in the …
Differentially private one permutation hashing and bin-wise consistent weighted sampling
Minwise hashing (MinHash) is a standard algorithm widely used in the industry, for large-
scale search and learning applications with the binary (0/1) Jaccard similarity. One common …
scale search and learning applications with the binary (0/1) Jaccard similarity. One common …
Online Differentially Private Synthetic Data Generation
We present a polynomial-time algorithm for online differentially private synthetic data
generation. For a data stream within the hypercube $[0, 1]^ d $ and an infinite time horizon …
generation. For a data stream within the hypercube $[0, 1]^ d $ and an infinite time horizon …
Differentially Private Gomory-Hu Trees
Given an undirected, weighted $ n $-vertex graph $ G=(V, E, w) $, a Gomory-Hu tree $ T $ is
a weighted tree on $ V $ such that for any pair of distinct vertices $ s, t\in V $, the Min-$ s …
a weighted tree on $ V $ such that for any pair of distinct vertices $ s, t\in V $, the Min-$ s …
Differentially Private Distance Query with Asymmetric Noise
With the growth of online social services, social information graphs are becoming
increasingly complex. Privacy issues related to analyzing or publishing on social graphs are …
increasingly complex. Privacy issues related to analyzing or publishing on social graphs are …
Near-Universally-Optimal Differentially Private Minimum Spanning Trees
Devising mechanisms with good beyond-worst-case input-dependent performance has
been an important focus of differential privacy, with techniques such as smooth sensitivity …
been an important focus of differential privacy, with techniques such as smooth sensitivity …