Pages that link to "Item:Q5466464"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466464):
Displaying 30 items.
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Towards better models of externalities in sponsored search auctions (Q1786603) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)
- On structured output training: hard cases and an efficient alternative (Q1959508) (← links)
- Note on long paths in Eulerian digraphs (Q2034059) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- Path-Based Mathematical Morphology on Tensor Fields (Q2806291) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Computing Directed Pathwidth in O(1.89 n ) Time (Q4899252) (← links)
- Divergence and quasi-isometry classes of random Gromov’s monsters (Q4958639) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- Finding Paths and Cycles of Superpolylogarithmic Length (Q5432365) (← links)
- (Q5501241) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
- On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) (Q6666794) (← links)
