论文信息 - A New Bound on the Length of Minimum Cycle Bases - 字舞流文

A New Bound on the Length of Minimum Cycle Bases

Mathematik Und | M. Und

[1] Narsingh Deo,et al. Algorithms for Generating Fundamental Cycles in a Graph , 1982, TOMS.

[2] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[3] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[4] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[5] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..

[6] Shang-Hua Teng,et al. Lower-stretch spanning trees , 2004, STOC '05.

[7] Kunal Talwar,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2004, J. Comput. Syst. Sci..

[8] R. Ravi,et al. On approximating planar metrics by tree metrics , 2001, Inf. Process. Lett..

[9] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.