Odd paths, cycles, and T-joins: connections and algorithms
From MaRDI portal
Odd paths, cycles, and \(T\)-joins: connections and algorithms
Cites work
- A characterization of weakly bipartite graphs
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms. Translated from the 6th English edition by Ulrich Brenner and Rabe von Randow
- Computing girth and cogirth in perturbed graphic matroids
- Detecting an Odd Hole
- Even cycles in directed graphs
- Generalized domino-parity inequalities for the symmetric traveling salesman problem
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
- Matroids and multicommodity flows
- On the complexity of testing for odd holes and induced odd paths
- Packing odd T‐joins with at most two terminals
- Packing odd paths
- Permanents, Pfaffian orientations, and even directed circuits
- Pólya's permanent problem
- Shortest odd paths in undirected graphs with conservative weight functions
- The directed subgraph homeomorphism problem
- The even-path problem for graphs and digraphs
- The shortest even cycle problem is tractable
- Weakly bipartite graphs and the max-cut problem
This page was built for publication: Odd paths, cycles, and \(T\)-joins: connections and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020159)
