參考文獻 |
[1] E. Ackerman, O. Ben-Zwi, G. Wolfovitz, Combinatorial model and bounds for
target set selection, Theoretical Computer Science 411 (2010) 4017-4022.
[2] S. S. Adams, D. S. Troxell, S. L. Zinnen, Dynamic monopolies and feedback
vertex sets in hexagonal grids, Computers and Mathematics with Applications
62 (2011) 4049-4057.
[3] B. Alspach, M. Dean, Honeycomb toroidal graphs are Caley graphs, Information
Processing Letters 109 (2009) 705-708.
[4] O. Ben-Zwi, D. Hermelin, D. Lokshtanov, I. Newman, Treewidth governs the
complexity of target set selection, Discrete Optimization 8 (2011) 87-96.
[5] E. Berger, Dynamic monopolies of constant size, J. Combin. Theory Ser. B, 83
(2001) 191-200.
[6] C. C. Centeno, M. C. Dourado, L. Draque Penso, D. Rautenbach, J. L. Szwarc-
fiter, Irreversible conversion of graphs, Theoretical Computer Science 412 (2011)
3693-3700.
[7] C. L. Chang, Y. D. Lyuu, Bounding the number of tolerable faults in majority-
based systems, Lecture Notes in Computer Science 6078 (2010) 109-119.
[8] G. Chartrand, F. Harary, Planar Permutation Graphs, Ann. Inst. Henri. Poincar¶e
Sect. B 3 (1967) 433-438.
[9] G. Chartrand, J. B. Frechen, On the Chromatic Number of Permutation Graphs.
In: F. Harary (ed.): Proof Techniques in Graph Theory, Proceedings of the Second Ann Arbor Graph Theory Conference, February 1968. Academic Press,
New York, pages 21-24, 1969.
[10] N. Chen, On the approximability of influence in social networks, SIAM Journal
on Discrete Mathematics, 23 (2009) 1400-1415.
[11] H-J Cho, L-Y Hsu, Generalized honeycomb torus, Information Processing Letters
86 (2003) 185-190.
[12] H. S. M. Coxeter, Self-Dual Configurations and Regular Graphs, Bull. Amer.
Math. Soc. 56 (1950) 413-455.
[13] G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25
(1961) 71-76.
[14] P. Domingos, M. Richardson, Mining the network value of customers, in Pro-
ceedings of ACM SIGKDD 2001, San Francisco, pages 57-66, 2001.
[15] P. A. Dreyer, Applications and Variations of Domination in Graphs, Ph.D. thesis,
Rutgers University, Piscataway, NJ, 2000.
[16] P. A. Dreyer, F. S. Roberts, Irreversible k-threshold processes: Graph-theoretical
threshold models of the spread of disease and of opinion, Discrete Applied Math.
157 (2009) 1615-1627.
[17] P. Festa, P. M. Pardalos, M. G. C. Resende, Feedback set problems, in Handbook
of Combinatorial Optimization, Supplement Vol. A, Kluwer Academic Publish-
ers, (2000) 209-259.
[18] P. Flocchini, F. Geurts, N. Santoro, Optimal irreversible dynamos in chordal
rings, Discrete Applied Mathematics 113 (2001) 23-42.
[19] P. Flocchini, R. Kr¶alovi·c, P. Ru¶zi·cka, A. Roncato, N. Santoro. On time versus
size for monotone dynamic monopolies in regular topologies, Journal of Discrete
Algorithms 1 (2003) 129-150.
[20] P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro, Dynamic monopolies in
tori, Discrete Applied Mathematics 137 (2004) 197-212.
[21] P. Flocchini, Contamination and Decontamination in Majority-Based Systems,
Journal of Cellular Automata 4 (2009) 183-200.
[22] D. R. Fulkerson, O. A. Gross, Incidence Matrices and Interval Graphs, Pacific
Journal of Mathematics, 15 (1965) 835-855.
[23] W. T. Huang, On the Spread of Viruses on Torus Cordalis Networks, Master’’s
Thesis, Department of Mathematics, National Central University, Taiwan, 2010.
[24] W. Imrich, S. Klav·zar, Product Graphs: Structure and Recognition, John Wiley &
Sons, 2000.
[25] R. M. Karp, Reducibility among combinatorial problems, Complexity of Com-
puter Computations 40 (1972) 85-103.
[26] D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of in°uence through a
social network, in Proceedings of the 9th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 137-146, 2003.
[27] D. Kempe, J. Kleinberg, E. Tardos, Influential nodes in a diffusion model for
social networks, in: Proceedings of the 32th International Colloquium on Au-
tomata, Languages and Programming, pages 1127-1138, 2005.
[28] K. Khoshkhah, H. Soltani, M. Zaker, On dynamic monopolies of graphs:
The average and strict majority thresholds, Discrete Optimization (2012),
doi:10.1016/j.disopt.2012.02.001
[29] D. M. Kilgour, Approval balloting for muti-winner elections, in J. Laslier &
M. R. Sanver (Eds.), Handbook on approval voting, pages 105-124, Heidelberg,
Springer.
[30] S. Kutten, D. Peleg, Fault-local distributed mending, in: Proceedings of the 36th
IEEE Symposium on Foundations of Computer Science, 1995.
[31] N. Linial, D. Peleg, Y. Rabinovich, M. Saks, Sphere packing and local majorities
in graphs, in: Second ISTCS, IEEE Computer Society Press, Silver Spring, MD,
pages 141-149, 1993.
[32] F. Luccio, Almost exact minimum feedback vertex set in meshes and butterflies,
Information Processing Letters 66 (1998) 59-64.
[33] F. Luccio, L. Pagli, H. Sanossian. Irreversible dynamos in butterflies, 6th Int.
Coll. on Structural Information and Communication Complexity (SIROCCO),
pages 204-218, 1999.
[34] B. Parhami, D-M Kwai, A Unified Formulation of Honeycomb and Diamond
Networks, IEEE Transactions on paralel and distributed systems 12 (2001) 74-
80.
[35] D. Peleg, Size bounds for dynamic monopolies, Discrete Applied Mathematics 86
(1998) 263-273.
[36] D. Peleg, Local majorities, coalitions and monopolies in graphs: a review, Theo-
retical Computer Science 282 (2002) 231-257.
[37] D. A. Pike, Y. Zou, Decycling Cartesian products of two cycles, SIAM Journal
on Discrete Mathematics, 19 (2005) 651-663.
[38] M. Richardson, P. Domingos, Mining knowledge-sharing sites for viral marketing,
in Proceedings of the 8th ACM SIGKDD, Edmonton, Canada, pages 61-70, 2002.
[39] F. S. Roberts, Challenges for discrete mathematics and theoretical computer sci-
ence in the defense against bioterrorism, in Bioterrorism: Mathematical Model-
ing Applications in Homeland Security, Frontiers Appl. Mathem. 28, H. T. Banks
and C. Castillo-Chavez, eds., SIAM, Philadelphia, pages 1-34, 2003.
[40] F. S. Roberts, Graph-theoretical problems arising from defending against
bioterrorism and controlling the spread of fires, in Proceedings of the DI-
MACS/DIMATIA/Renyi Combinatorial Challenges Conference, Piscataway, NJ,
2006.
[41] D. J. Rose, R. E. Tarjan, G. S. Lueker, Algorithmic Aspects of Vertex Elimination
on Graphs, SIAM Journal on Computing, 5 (1976) 266-283.
[42] I. Stojmenovic, Honeycomb networks: Topological properties and communication
algorithms, IEEE Trans. Parallel Distributed Systems, 8 (1997) 1036-1042.
[43] S. Stueckle, R. D. Ringeisen, Generalized Petersen graphs which are cycle per-
mutation graphs, Journal of Combinatorial Theory B, 37 (1984) 142-150.
[44] R. E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of
graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs,
SIAM Journal on Computing, 13 (1984) 566-579.
[45] M. Watkins, A Theorem on Tait Colourings with an Application to the General-
ized Petersen Graphs, Journal of Combinatorial Theory, 6 (1969) 152-164.
[46] D. J. Watts, The accidental influentials, Harvard Business Review, 85 (2007)
22-23.
[47] X. Yang, The diameter of honeycomb rhombic tori, Applied Mathematics Letters
17 (2004) 167-172.
[48] M. Zaker, On dynamic monopolies of graphs with general thresholds, Discrete
Mathematics 312 (2012) 1136-1143.
|