Author:
Corneil Derek G.,Dragan Feodor F.,Habib Michel,Paul Christophe
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. Fast estimation of diameter and shortest paths (without matrix multiplication);Aingworth;SIAM J. Comput.,1999
2. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hyper-tree structure and maximum neighborhood orderings, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of WG’94 Graph–Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 65–80; Discrete Appl. Math. 82 (1998) 43–77.
3. A characterization of rigid circuit graphs;Buneman;Discrete Math.,1974
4. On distances in benzenoid systems;Chepoi;J. Chem. Inference Comput. Sci.,1996
5. V.D. Chepoi, F.F. Dragan, Disjoint sets problem, unpublished, 1992.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献