No article text was recorded for this version.
degeneracy-based DAG orientation
Version 1 of 160 papers88 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Faster algorithms for counting subgraphs in sparse graphs
- Blog: A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap
- Blog: Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
- Blog: Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
- Blog: Parallel Algorithms for Finding Large Cliques in Sparse Graphs
- Blog: New lower bounds of fifteen classical Ramsey numbers
- Blog: Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection
- Blog: Approximately Counting Subgraphs in Data Streams
- Blog: Listing Maximal k-Plexes in Large Real-World Graphs
- Blog: Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques
- Blog: Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
- Blog: Deep Homomorphism Networks
- Blog: Cubicity, degeneracy, and crossing number
- Blog: Efficient graphlet kernels for large graph comparison
- Blog: D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes
- Blog: Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
- Blog: ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
- Blog: A Finer View of the Parameterized Landscape of Labeled Graph Contractions
- Blog: Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
- Blog: Multivariate Algorithmics for Finding Cohesive Subnetworks
- Blog: Extendability of causal graphical models: Algorithms and computational complexity
- Blog: Triad Enumeration at Trillion-Scale Using a Single Commodity Machine
- Blog: Efficient k-Clique Listing: An Edge-Oriented Branching Strategy
- Blog: A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length
- Blog: TurboReg: TurboClique for Robust and Efficient Point Cloud Registration
- Blog: On degeneracy and the parameterized complexity of subgraph counting
- Blog: Faster algorithms for counting subgraphs in sparse graphs
- Blog: Parameterized Local Search for Max c-Cut
- Blog: Local Max-Cut on Sparse Graphs
- Blog: Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
- Blog: A Faster Branching Algorithm for the Maximum k-Defective Clique Problem
- Blog: Efficient Enumeration of Four Node Graphlets at Trillion-Scale
- Blog: Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
- Blog: Enumerating Markov Equivalence Classes of Acyclic Digraph Models
- Blog: Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
- Blog: Ordering Heuristics for k-clique Listing
- Blog: Parallel Clique Counting and Peeling Algorithms
- Blog: TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
- Blog: Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
- Blog: GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
- Blog: Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
- Blog: Structural perspective on constraint-based learning of Markov networks
- Blog: Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)
- Blog: A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
- Blog: Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
- Blog: Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection
- Blog: Subgraph Counting: Color Coding Beyond Trees
- Blog: The Power of Pivoting for Exact Clique Counting
- Blog: Efficient and Effective Community Search on Large-scale Bipartite Graphs
- Blog: AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
- Blog: A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
- Blog: Counting Triangles in Large Graphs on GPU
- Blog: How the Degeneracy Helps for Triangle Counting in Graph Streams
- Blog: Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension
- Blog: Cliques in Odd-Minor-Free Graphs
- Blog: Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
- Blog: Short Certificates for Tournaments
- Blog: One Quadrillion Triangles Queried on One Million Processors
- Blog: K-Connected Cores Computation in Large Dual Networks
- Blog: Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs
History & citation
Current · Permanent link
- Degeneracy Based Orientations for Faster Subgraph Counting merged into this direction (80% overlap)
- Subgraph Counting in Bounded Degeneracy Graphs merged into this direction (54% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_degeneracy_based_dag_orientation_a3581b23,
title = {degeneracy-based DAG orientation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/degeneracy-based-dag-orientation/rdr_a3581b235aeb4ef4ad3358810ca57c18},
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_degeneracy_based_dag_orientation_a3581b23_v1,
title = {degeneracy-based DAG orientation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/degeneracy-based-dag-orientation/rdr_a3581b235aeb4ef4ad3358810ca57c18/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}