The even-path problem for graphs and digraphs
From MaRDI portal
Recommendations
Cited in
(36)- An efficient Dijkstra-like labeling method for computing shortest odd/even paths
- A note on odd/even cycles
- Understanding the complexity of axiom pinpointing in lightweight description logics
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- The parity path problem on some subclasses of perfect graphs
- A trichotomy for regular simple path queries on graphs
- Backdoors to tractable answer set programming
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Quick but odd growth of cacti
- Finding induced paths of given parity in claw-free graphs
- How many attackers can selfish defenders catch?
- Graphs and complete intersection toric ideals
- The Even Cycle Problem for Planar Digraphs
- Odd multiway cut in directed acyclic graphs
- Evaluation and enumeration problems for regular path queries
- Handling controversial arguments
- scientific article; zbMATH DE number 3922696 (Why is no real title available?)
- An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
- LP extreme points and cuts for the fixed-charge network design problem
- scientific article; zbMATH DE number 867679 (Why is no real title available?)
- Finding an Even Simple Path in a Directed Planar Graph
- Odd Multiway Cut in Directed Acyclic Graphs
- Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
- Finding a shortest non-zero path in group-labeled graphs via permanent computation
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- Finding an induced path of given parity in planar graphs in polynomial time
- A Trichotomy for Regular Trail Queries
- DFS tree construction: Algorithms and characterizations
- Search-space reduction via essential vertices
- Shortest odd paths in undirected graphs with conservative weight functions
- Modern techniques for querying graph-structured databases
- Problems on group-labeled matroid bases
- Finding a shortest non-zero path in group-labeled graphs
- Odd paths, cycles, and T-joins: connections and algorithms
- EvenPath in directed single-crossing graphs
- The Even-Path problem in directed single-crossing-minor-free graphs
This page was built for publication: The even-path problem for graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345793)
