No article text was recorded for this version.
edge-degree constrained subgraph
Version 1 of 123 papers30 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Sublinear Algorithms for (1.5+ε)-Approximate Matching
- Blog: Filtering Random Graph Processes Over Random Time-Varying Graphs
- Blog: Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
- Blog: Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
- Blog: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
- Blog: Towards a Unified Theory of Sparsification for Matching Problems
- Blog: Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
- Blog: Generalized Stochastic Matching
- Blog: Stochastic Matching with Few Queries: (1-ε) Approximation
- Blog: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
- Blog: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
- Blog: On the Distributed Complexity of Computing Maximal Matchings
- Blog: Decentralized Optimization with Edge Sampling
- Blog: Deterministic Rounding of Dynamic Fractional Matchings
- Blog: Beating Two-Thirds For Random-Order Streaming Matching
- Blog: Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation
- Blog: Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
- Blog: On the Robust Communication Complexity of Bipartite Matching
- Blog: Weighted Matching in the Random-Order Streaming and Robust Communication Models
- Blog: Label Cover instances with large girth and the hardness of approximating basic k-spanner
- Blog: On Sparsification of Stochastic Packing Problems
- Blog: Butterfly Counting in Bipartite Networks
- Blog: Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_edge_degree_constrained_subgraph_4474f43c,
title = {edge-degree constrained subgraph},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-degree-constrained-subgraph/rdr_4474f43cb37543cfa44410c5ae0f2504},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_edge_degree_constrained_subgraph_4474f43c_v1,
title = {edge-degree constrained subgraph},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-degree-constrained-subgraph/rdr_4474f43cb37543cfa44410c5ae0f2504/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}