Author:
Hirai Hiroshi,Namba Hiroyuki
Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference16 articles.
1. Björklund, A.: Counting perfect matchings as fast as Ryser. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 914–921. ACM, New York (2012)
2. Björklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. Proceedings of 41st International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 8572, pp. 211–222. Springer, Berlin (2014)
3. Colin de Verdière, É., Schrijver, A.: Shortest vertex-disjoint two-face paths in planar graphs. ACM Trans. Algorithms 7(19), 12 (2011)
4. Gallai, T.: Maximum-minimum Sätze und verallgemeinerte Faktoren von Graphen. Acta Math. Acad. Sci. Hung. 12, 131–173 (1961)
5. Hirai, H., Pap, G.: Tree metrics and edge-disjoint S-paths. Math. Program. 147, 81–123 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster 2-Disjoint-Shortest-Paths Algorithm;Computer Science – Theory and Applications;2020
2. Shortest Two Disjoint Paths in Polynomial Time;SIAM Journal on Computing;2019-01