Pages that link to "Item:Q3345793"
From MaRDI portal
The following pages link to The even-path problem for graphs and digraphs (Q3345793):
Displaying 28 items.
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- The parity path problem on some subclasses of perfect graphs (Q1923620) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Graphs and complete intersection toric ideals (Q2947374) (← links)
- The Even Cycle Problem for Planar Digraphs (Q3141521) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Handling controversial arguments (Q3400791) (← links)
- (Q3698827) (← links)
- An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ (Q3710537) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- (Q4873791) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- (Q5743428) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
- Modern techniques for querying graph-structured databases (Q6638536) (← links)
