Pages that link to "Item:Q1887070"
From MaRDI portal
The following pages link to Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070):
Displayed 5 items.
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)