Pages that link to "Item:Q813970"
From MaRDI portal
The following pages link to A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970):
Displaying 10 items.
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs (Q1989955) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (Q2826672) (← links)
- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078) (← links)
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
