Author:
Kawarabayashi Ken-ichi,Kobayashi Yusuke,Reed Bruce
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference41 articles.
1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
3. The all-or-nothing multicommodity flow problem;Chekuri,2004
4. Edge-disjoint paths in planar graphs;Chekuri,2004
5. Multicommodity flow, well-linked terminals, and routing problems;Chekuri,2005
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Paired Many-to-Many 2-Disjoint Path Covers in Meshes;IEEE Transactions on Parallel and Distributed Systems;2024-10
2. Edge-Disjoint Paths in Eulerian Digraphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. A more accurate view of the Flat Wall Theorem;Journal of Graph Theory;2024-05-13
4. Social disruption games in signed networks;Communications in Nonlinear Science and Numerical Simulation;2024-05
5. Steiner connectivity problems in hypergraphs;Information Processing Letters;2024-01