The following pages link to (Q5743428):
Displaying 7 items.
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- (Q6065419) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)