No article text was recorded for this version.
graph class generalization
Version 1 of 1238 papers245 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Single Source - All Sinks Max Flows in Planar Digraphs
- Blog: Geodesics and almost geodesic cycles in random regular graphs
- Blog: Poisson approximation for non-backtracking random walks
- Blog: Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
- Blog: A combinatorial proof of Rayleigh monotonicity for graphs
- Blog: Existence and Size of the Giant Component in Inhomogeneous Random K-Out Graphs
- Blog: A unified view of graph regularity via matrix decompositions
- Blog: Planar Graph Perfect Matching Is in NC
- Blog: Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
- Blog: Concentration of the Kirchhoff index for Erdős-Rényi graphs
- Blog: The power of adaptivity in source identification with time queries on the path
- Blog: Testing Small Set Expansion in General Graphs
- Blog: Edge-Disjoint Paths in Planar Graphs
- Blog: A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs
- Blog: Decremental SPQR-trees for Planar Graphs
- Blog: Exact complexity of Exact-Four-Colorability
- Blog: Optimal Bounds for the k-cut Problem
- Blog: Towards (1 + ∊)-Approximate Flow Sparsifiers
- Blog: Primal-Dual Cops and Robber
- Blog: On Rectilinear Drawing of Graphs
- Blog: Nearly Tight Bounds for Sandpile Transience on the Grid
- Blog: Analysis of Multilevel Graph Partitioning
- Blog: The inducibility of oriented stars
- Blog: Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
- Blog: Random Graph Asymptotics for Treatment Effect Estimation under Network Interference
- Blog: Goodness-of-fit tests for high-dimensional Gaussian graphical models via exchangeable sampling
- Blog: Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
- Blog: Improved Analysis of Deterministic Load-Balancing Schemes
- Blog: Generating massive complex networks with hyperbolic geometry faster in practice
- Blog: Central limit theorem for the average closure coefficient
- Blog: The Number of $f$-Matchings in Almost Every Tree is a Zero Residue
- Blog: Sequential sampling of junction trees for decomposable graphs
- Blog: The shortest distance in random multi-type intersection graphs
- Blog: Spectral gap in random bipartite biregular graphs and applications
- Blog: Torpid Mixing of Markov Chains for the Six-vertex Model on ℤ2
- Blog: Improved and simplified inapproximability for k-means
- Blog: Designing and Learning Substitutable Plane Graph Grammars
- Blog: Stochastic Distance in Property Testing
- Blog: A Complexity Analysis of the c-Closed Vertex Deletion Problem
- Blog: Sampling colorings almost uniformly in sparse random graphs
- Blog: Quantum approximate optimization algorithms for maximum cut on low-girth graphs
- Blog: A Consistent Diffusion-Based Algorithm for Semi-Supervised Graph Learning
- Blog: Some mader-perfect graph classes
- Blog: Spectral partitioning of time-varying networks with unobserved edges
- Blog: Belief propagation for graph partitioning
- Blog: Finding a Bounded-Degree Expander Inside a Dense One
- Blog: Progress towards the two-thirds conjecture on locating-total dominating sets
- Blog: Smoothed Analysis of Dynamic Networks
- Blog: Scalable Motif-aware Graph Clustering
- Blog: Local Neighbourhoods for First-Passage Percolation on the Configuration Model
- Blog: Optimal performance of Graph Convolutional Networks on the Contextual Stochastic Block Model
- Blog: Large induced forests in sparse graphs
- Blog: Graph Clustering with Graph Neural Networks
- Blog: (Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
- Blog: Controllability Analysis of Threshold Graphs and Cographs
- Blog: Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- Blog: Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
- Blog: A Face Cover Perspective to ℓ1 Embeddings of Planar Graphs
- Blog: Local Tree-Width, Excluded Minors, and Approximation Algorithms
- Blog: Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
Showing 60 of 238 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_graph_class_generalization_b7903321,
title = {graph class generalization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-class-generalization/rdr_b79033217a9840cb8b6b55537b0eeb52},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_graph_class_generalization_b7903321_v1,
title = {graph class generalization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-class-generalization/rdr_b79033217a9840cb8b6b55537b0eeb52/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}