Søk Bilder Maps Play YouTube Nyheter Gmail Disk Mer »
Logg på
Bøker Bok 16 av 6Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph,
" Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph, "
Diagraphs: Theory, Algorithms and Applications - Side 708
av Jørgen Bang-Jensen, Gregory Gutin - 2002 - 754 sider
Begrenset visning - Om denne boken

Graph Theory and Algorithms: 17th Symposium of Research Institute of ...

N. Saito, T. Nishizeki - 1981 - 216 sider
...and the interconnection problem", ACM SIGDA Newsletter 5 : 3 (1975). [3] Perl, Y. and Shiloach, Y., "Finding two disjoint paths between two pairs of vertices in a graph", J. Assoc. Comput. Mach. 25, pp. 1-9 (1978) . [4] Shiloach, Y. , "A polynominal solution to the undirected two paths problem",...
Begrenset visning - Om denne boken

Handbook of Electronic Package Design

Michael Pecht - 1991 - 904 sider
...Placement," Proc. 2 1st Design Automation Conference, 1984, pp. 399-404. Perl, Y. andShiloach, Y., "Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph," Journal of the Association for Computer Machinery 25:1-9 (1978). Persky, G., Deutsch, DN and Schweikert,...
Begrenset visning - Om denne boken

Graph-Theoretic Concepts in Computer Science: 31st International Workshop ...

Dieter Kratsch - 2005 - 470 sider
...small width, International Journal of Foundations of Computer Science (MFCS) 11 (2000), pp. 365-371. 8. Y. Perl and Y. Shiloach, Finding two disjoint paths between two pairs of vertices in a graph, J. ACM 25 (1978), pp. 1-9. 9. N. Robertson and PD Seymour, Graph minors. XIII. The disjoint paths problem,...
Begrenset visning - Om denne boken

Practical Aspects of Declarative Languages: 8th International Symposium ...

Pascal van Hentenryck - 2005 - 234 sider
...Transactions on Programming Languages and Systems, 19(2):239-252, March 1997. [SP78] Y. Shiloach and Y. Perl. Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM, 1978. [SPMa] Spmn.22. Available at http://www.info.ucl.ac.be/~lugue/PADL06/testJ22.ps....
Begrenset visning - Om denne boken

Algorithmic Aspects in Information and Management: Third International ...

Ming-Yang Kao, Xiang-Yang Li - 2007 - 428 sider
...disjoint paths with Min-Max objective function. Discrete Applied Mathematics, 26(1):105-115, 1990. 8. Y. Perl and Y. Shiloach. Finding two disjoint paths between two pairs of vertices in a graph. J. ACM, 25(1):l-9, 1978. 9. JW Suurballe and R. Tarjan. A quick method for finding shortest pairs of disjoint...
Begrenset visning - Om denne boken

Graph-Theoretic Concepts in Computer Science: 33rd International Workshop ...

Andreas Brandstädt, Dieter Kratsch - 2007 - 340 sider
...decompositions of small width. Internat. J. Foundat. Comput. Sci. 11, 365-371 (2000) 6. Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM 25, 1-9 (1978) 7. Robertson, N., Seymour, PD: Graph Minors. XIII. The disjoint paths problem. J....
Begrenset visning - Om denne boken




  1. Mitt bibliotek
  2. Hjelp
  3. Avansert boksøk