Representing paths in digraphs

DOI10.4230/LIPICS.CPM.2025.1MaRDI QIDQ7299432zbMATH OpenFDO

Authors Riccardo Dondi, Alexandru Popa

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2025.1

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A combinatorial problem in geometry.
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Approximation algorithms for the longest run subsequence problem
• Computational graph pangenomics: a tutorial on data structures and their applications
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7696000 (Why is no real title available?)
• Improved approximate pattern matching on hypertext
• On approximating the longest path in a graph
• On the complexity of approximately matching a string to a directed graph
• On the complexity of sequence to graph alignment
• On the Complexity of String Matching for Graphs
• On the parameterized complexity of multiple-interval graph problems
• Pattern Matching in Hypertext
• Some optimal inapproximability results
• The design of approximation algorithms
• The longest letter-duplicated subsequence and related problems
• The longest subsequence-repeated subsequence problem

This page was built for publication: Representing paths in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299432)