No article text was recorded for this version.
graph density sensitivity
Version 2 of 2122 papers136 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Correction: A Hybrid CPU-GPU Accelerated Framework for Fast Mapping of High-Resolution Human Brain Connectome
- Blog: Deep Analysis on Subgraph Isomorphism
- Blog: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
- Blog: MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
- Blog: An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
- Blog: Conditionally Optimal Algorithms for Generalized Büchi Games
- Blog: Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process
- Blog: Incremental Satisfiability and Implication for UTVPI Constraints
- Blog: Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
- Blog: MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
- Blog: Improved Exact and Heuristic Algorithms for Maximum Weight Clique
- Blog: Algorithmic QUBO formulations for <i>k</i> -SAT and hamiltonian cycles
- Blog: Sparse Gaussian Graphical Models with Discrete Optimization: Computational and Statistical Perspectives
- Blog: Implementation of a maximum clique search procedure on CUDA
- Blog: Context-aware Path Ranking for Knowledge Base Completion
- Blog: All-Hops Shortest Paths
- Blog: Speeding up the Passenger Assignment Problem in transit planning by the Direct Link Network representation
- Blog: CMOS-Compatible Ising Machines built using Bistable Latches Coupled through Ferroelectric Transistor Arrays
- Blog: A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph
- Blog: An efficient algorithm for 1-dimensional (persistent) path homology
- Blog: A Reduction-Based Algorithm for the Clique Interdiction Problem
- Blog: Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach
- Blog: Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment
- Blog: Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs
- Blog: Improved Algorithms for One-Pair and k-Pair Streett Objectives
- Blog: Turbocharging Heuristics for Weak Coloring Numbers
- Blog: Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams
- Blog: Newton-type Methods for Inference in Higher-Order Markov Random Fields
- Blog: Cut Tree Construction from Massive Graphs
- Blog: Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Blog: A Simple Dynamic Spanner via APSP
- Blog: Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances
- Blog: Counting and Sampling from Markov Equivalent DAGs Using Clique Trees
- Blog: Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles
- Blog: Maximizing Information Dissemination in Social Network via a Fast Local Search
- Blog: Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains
- Blog: ε-net Induced Lazy Witness Complexes on Graphs
- Blog: Tractability and Structural Closures in Attribute Logic Type Signatures
- Blog: On The Multiparty Communication Complexity of Testing Triangle-Freeness
- Blog: Large-Scale Sparse Inverse Covariance Estimation via Thresholding and\n Max-Det Matrix Completion
- Blog: Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques
- Blog: MRAttractor: Detecting Communities from Large-Scale Graphs
- Blog: Computational and Statistical Tradeoffs in Inferring Combinatorial Structures of Ising Model
- Blog: Linear complexity SimRank computation based on the iterative diagonal estimation
- Blog: Average Case Analysis of Fully Dynamic Reachability for Directed Graphs
- Blog: An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology
- Blog: Simple and Asymptotically Optimal Online Bipartite Edge Coloring
- Blog: Simplicial SMOTE: Oversampling Solution to the Imbalanced Learning Problem
- Blog: Trimmed Moebius Inversion and Graphs of Bounded Degree
- Blog: On Finding Frequent Patterns in Event Sequences
- Blog: Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
- Blog: GPU-Accelerated Parallel Gene-pool Optimal Mixing in a Gray-Box Optimization Setting
- Blog: Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
- Blog: Exploring Effects of Random Walk Based Minibatch Selection Policy on Knowledge Graph Completion
- Blog: Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads
- Blog: Sparse Diffusion-Convolutional Neural Networks
- Blog: Conjunctive Width Heuristics for Maximal Constraint Satisfaction
- Blog: A Comparative Study of Graph Matching Algorithms in Computer Vision
- Blog: Active Structure Learning of Causal DAGs via Directed Clique Trees
- Blog: Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints
Showing 60 of 122 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_graph_density_sensitivity_085314c1,
title = {graph density sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-density-sensitivity/rdr_085314c1bc4b4c2abf39f75e015c53ca},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_graph_density_sensitivity_085314c1_v2,
title = {graph density sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-density-sensitivity/rdr_085314c1bc4b4c2abf39f75e015c53ca/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}