Cover Image

Enumerating m-Length Walks in Directed Graphs with Constant Delay

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Adamson, Duncan, Gawrychowski, Pawel, Manea, Florin
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
by: Gawrychowski, Pawel, et al.
Published: (2024)

Enumerating All Directed Spanning Trees in Optimal Time
by: Gawrychowski, Paweł, et al.
Published: (2026)

Optimal Distance Labeling for Permutation Graphs
by: Gawrychowski, Paweł, et al.
Published: (2024)

Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025)

Exploring Temporal Graphs with Frequent and Regular Edges
by: Adamson, Duncan
Published: (2025)

Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
by: Gawrychowski, Paweł, et al.
Published: (2024)

Dynamic Longest Common Substring in Polylogarithmic Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)

Equivalences between Non-trivial Variants of 3LDT and Conv3LDT
by: Dudek, Bartłomiej, et al.
Published: (2020)

Exploration of Always $S$-Connected Temporal Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
by: Gawrychowski, Paweł, et al.
Published: (2024)

Optimal Bounds for Distinct Quartics
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
by: Manea, Florin, et al.
Published: (2024)

Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024)

Balancing Two-Dimensional Straight-Line Programs
by: Boneh, Itai, et al.
Published: (2025)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
by: Casel, Katrin, et al.
Published: (2019)

Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)

Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)

Estimating Random-Walk Probabilities in Directed Graphs
by: Bertram, Christian, et al.
Published: (2025)

Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)

Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)

Rollercoasters with Plateaus
by: Adamson, Duncan, et al.
Published: (2024)

Edge-Minimum Walk of Modular Length in Polynomial Time
by: Amarilli, Antoine, et al.
Published: (2024)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
by: Kobayashi, Yasuaki, et al.
Published: (2020)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)

From Amortized to Worst Case Delay in Enumeration Algorithms
by: Capelli, Florent, et al.
Published: (2021)

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
by: Manea, Florin, et al.
Published: (2025)

Gray Codes With Constant Delay and Constant Auxiliary Space
by: Amarilli, Antoine, et al.
Published: (2026)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
by: Haeupler, Bernhard, et al.
Published: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
by: Kobayashi, Yasuaki, et al.
Published: (2023)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

Counting Patterns in Degenerate Graphs in Constant Space
by: Komarath, Balagopal, et al.
Published: (2025)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

Transversal Rank, Conformality and Enumeration
by: Schirneck, Martin
Published: (2026)

Distinct Shortest Walk Enumeration for RPQs
by: David, Claire, et al.
Published: (2023)