Author:
Robertson Neil,Seymour P.D
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. On the computational complexity of combinatorial problems;Karp;Networks,1975
2. The equivalence of theorem proving and the interconnection problem;Lynch;ACM SIGMA Newsletter,1975
3. N. Robertson and P. D. Seymour, Graph minors. VII. Disjoint paths on a surface, submitted for publication.
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20
2. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Precoloring extension in planar near-Eulerian-triangulations;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Mehrgüterflüsse und kantendisjunkte Wege;Kombinatorische Optimierung;2018
5. Multicommodity Flows and Edge-Disjoint Paths;Algorithms and Combinatorics;2018