Network Majority on Tree Topological Network
暂无分享,去创建一个
Zsolt Tuza | Tadashi Sakuma | Yannis Manoussakis | Shinya Fujita | Yasuko Matsui | Sylvain Legay | Ravindra B. Bapat
[1] Dominic Lanphier,et al. Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs , 2009, SIAM J. Discret. Math..
[2] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.
[3] Tadashi Sakuma,et al. Safe set problem on graphs , 2016, Discret. Appl. Math..
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[5] Wayne Goddard,et al. A Survey of Integrity , 1992, Discret. Appl. Math..
[6] Pim van 't Hof,et al. On the Computational Complexity of Vertex Integrity and Component Order Connectivity , 2014, Algorithmica.
[7] Pim van 't Hof,et al. On the Computational Complexity of Vertex Integrity and Component Order Connectivity , 2014, ISAAC.
[8] Claus Ernst,et al. On the Range of Possible Integrities of Graphs G(n, k) , 2011, Graphs Comb..
[9] A. Vince. The integrity of a cubic graph , 2004, Discret. Appl. Math..
[10] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.