Combinatorial network abstraction by trees and distances
暂无分享,去创建一个
Sebastian Wernicke | Sven Kosub | Moritz G. Maaß | Hanjo Täubig | Stefan Eckhardt | Sven Kosub | S. Wernicke | Hanjo Täubig | Stefan Eckhardt
[1] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[2] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[3] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[4] Guy Kortsarz,et al. Generating Sparse 2-Spanners , 1992, J. Algorithms.
[5] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[6] Leizhen Cai,et al. Tree Spanners , 1995, SIAM J. Discret. Math..
[7] Leizhen Cai,et al. NP-Completeness of Minimum Spanner Problems , 1994, Discret. Appl. Math..
[8] Refael Hassin,et al. On the Minimum Diameter Spanning Tree Problem , 1995, Inf. Process. Lett..
[9] Erich Prisner. Distance Approximating Spanning Trees , 1997, STACS.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .
[12] Feodor F. Dragan,et al. Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.
[13] Jan Karel Lenstra,et al. The complexity of the network design problem : (preprint) , 1977 .
[14] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[15] Paul Chew,et al. There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..
[16] P. Camerini,et al. Complexity of spanning tree problems: Part I , 1980 .
[17] Hawoong Jeong,et al. Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[18] Sándor P. Fekete,et al. Tree spanners in planar graphs , 2001, Discret. Appl. Math..
[19] D. Wagner,et al. Additive Tree Spanners , 2004 .
[20] M. A. Beauchamp. AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.
[21] Dagmar Handke,et al. NP-Completeness Results for Minimum Planar Spanners , 1998, Discret. Math. Theor. Comput. Sci..
[22] Ulrik Brandes,et al. Network Analysis: Methodological Foundations , 2010 .
[23] Gert Sabidussi,et al. The centrality index of a graph , 1966 .
[24] J. Soares. Graph Spanners: a Survey , 1992 .
[25] David Eppstein,et al. Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.
[26] Guy Kortsarz. On the Hardness of Approximating Spanners , 2001, Algorithmica.
[27] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[28] Wayne Goddard,et al. MAD trees and distance-hereditary graphs , 2003, Discret. Appl. Math..
[29] C. Pandu Rangan,et al. Restrictions of Minimum Spanner Problems , 1997, Inf. Comput..
[30] Arthur L. Liestman,et al. Additive graph spanners , 1993, Networks.
[31] Jan Karel Lenstra,et al. The complexity of the network design problem , 1978, Networks.
[32] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[33] Sebastian Wernicke,et al. Combinatorial network abstraction by trees and distances , 2005, Theor. Comput. Sci..
[34] David Peleg,et al. (1 + εΒ)-spanner constructions for general graphs , 2001, STOC '01.
[35] Dagmar Handke,et al. Graphs with distance guarantees , 1999 .
[36] David Peleg,et al. Low Complexity Variants of the Arrow Distributed Directory , 2001, J. Comput. Syst. Sci..