Publication | Closed Access
The edge-disjoint paths problem is NP-complete for series–parallel graphs
76
Citations
23
References
2001
Year
Network ScienceGraph TheoryGraph AlgorithmsEngineeringStructural Graph TheoryNetwork AnalysisPath ProblemsParallel ProgrammingSeries–parallel GraphsGraph Algorithm
| Year | Citations | |
|---|---|---|
Page 1
Page 1