Author:
Holt Richard C.,Reingold Edward M.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference7 articles.
1. E. Dijkstra, A note on two problems in connection with graphs,Numer. Math 1 (1959), 269–271.
2. D. Dreyfus, An appraisal of some shortest path algorithms,Operations Res. 17 (1969), 395–412.
3. J. Hopcroft andR. Tarjan, Planarity testing in V log V steps, to appear in IFIP, 1971.
4. L. Kerr, personal correspondence.
5. R. B. Marimont, A new method of checking the consistency of precedence matrices,J. Assoc. Comput. Mach. 6 (1959), 164–171.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Theory of Computational Complexity;2014-06-13
2. Bibliography;Theory of Computational Complexity;2013-12-06
3. On the sensitivity complexity of bipartite graph properties;Theoretical Computer Science;2013-01
4. Testing whether a digraph contains H-free k-induced subgraphs;Theoretical Computer Science;2008-11
5. On the elusiveness of Hamiltonian property;Acta Mathematicae Applicatae Sinica;2001-01