An approach to the k paths problem
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given.