No article text was recorded for this version.
algebraic path detection
Version 1 of 110 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Extensor-coding
- Blog: Efficient Algorithms for the Disjoint Shortest Paths Problem and Its Extensions
- Blog: Patching Colors with Tensors
- Blog: Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
- Blog: Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras
- Blog: Randomized Parameterized Algorithms for the Kidney Exchange Problem
- Blog: Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints
- Blog: Parameterized Complexity of Kidney Exchange Revisited
- Blog: Finding the Minimum-Weight k-Path
- Blog: A Space-Efficient Algebraic Approach to Robotic Motion Planning
History & citation
Current · Permanent link
- This direction split from Algebraic Sieving for Simple Subgraph Detection (70% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_algebraic_path_detection_eed0a037,
title = {algebraic path detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-path-detection/rdr_eed0a03789de41f28311b079cc47f359},
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_algebraic_path_detection_eed0a037_v1,
title = {algebraic path detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-path-detection/rdr_eed0a03789de41f28311b079cc47f359/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}