No article text was recorded for this version.
sparsity-preserving spanning tree construction
Version 1 of 111 papers18 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fixed-Parameter Tractable Distances to Sparse Graph Classes
- Blog: When do homomorphism counts help in query algorithms?
- Blog: On algorithms based on finitely many homomorphism counts
- Blog: Deciding First-Order Properties of Nowhere Dense Graphs
- Blog: Model-Checking on Ordered Structures
- Blog: First-Order Query Evaluation with Cardinality Conditions
- Blog: Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)
- Blog: Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs
- Blog: Complexity of Token Swapping and Its Variants
- Blog: A Structural Approach to Activity Selection
- Blog: Sparse induced subgraphs in P6-free graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sparsity_preserving_spanning_tree_constr_ed231b5c,
title = {sparsity-preserving spanning tree construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparsity-preserving-spanning-tree-construction/rdr_ed231b5cc12a4a61a472c38a300342a1},
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_sparsity_preserving_spanning_tree_constr_ed231b5c_v1,
title = {sparsity-preserving spanning tree construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparsity-preserving-spanning-tree-construction/rdr_ed231b5cc12a4a61a472c38a300342a1/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}