Complexity of pairwise shortest path routing in the grid-Reference-Cited by-同舟云学术

Complexity of pairwise shortest path routing in the grid

Published:2004-10 Issue:1-3 Volume:326 Page:155-185
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gonzalez Teofilo F.,Serena David

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Node-disjoint paths on the mesh and a new trade-off in VLSI layout;Aggarwal;SIAM J. Comput.,2000

2. Linear-time algorithms for testing the satisfiability of propositional horn formulae;Dowling;J. Logic,1984

3. From Hall's matching theorem to optimal routing on hypercubes;Gao;J. Combin. Theory Ser. B,1998

4. Complexity and approximations for multimessage multicasting;Gonzalez;J. Parallel Distributed Comput.,1998

5. T.F. Gonzalez, F.D. Serena, Node disjoint shortest paths for pairs of vertices in an n-cube network, in: Proc. Internat. Conf. Parallel and Distributed Computing and Sytems (PDCS2001), 2001, IASTED, pp. 278–282 (full version appears as UCSB TRCS-2001-16, September 2001).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers;Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems;2019-04-04

2. Formal constraint-based compilation for noisy intermediate-scale quantum systems;Microprocessors and Microsystems;2019-04

3. Algorithmic Basis for Pathway Visualization;Pathway Analysis for Drug Discovery;2008-04-21

4. Pairwise edge disjoint shortest paths in the n-cube;Theoretical Computer Science;2006-12