{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:44:30Z","timestamp":1725648270106},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245527"},{"type":"electronic","value":"9783642245534"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-24553-4_55","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T04:49:00Z","timestamp":1325566140000},"page":"418-425","source":"Crossref","is-referenced-by-count":1,"title":["An Effective Ant Colony Algorithm for Graph Planarization Problem"],"prefix":"10.1007","author":[{"given":"Li-Qing","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Long","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","volume-title":"Planar Graphs: Theory and Algorithm","author":"T. Nishizeki","year":"1988","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithm. North Holland, Amsterdam (1988)"},{"key":"55_CR2","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of non-planar edges of a graph. In: Proc. 10th South-East Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, USA, pp. 727\u2013738 (1977)"},{"issue":"3","key":"55_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R. Jayakumar","year":"1989","unstructured":"Jayakumar, R., Thulasiraman, K., Swamy, M.N.S.: O(n 2) algorithms for graph planarization. IEEE Trans.Comput.-Aided Des.Integr.Circuits Syst.\u00a08(3), 257\u2013267 (1989)","journal-title":"IEEE Trans.Comput.-Aided Des.Integr.Circuits Syst."},{"key":"55_CR4","unstructured":"Kant, G.: An O(n 2) maximal planarization algorithm based on PQ-tree, Technical Report RUU-CS-92-03. Dept. of Computer Science, Utrecht University, Utrecht, the Netherlands (1992)"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J. Cai","year":"1993","unstructured":"Cai, J., Han, X., Tarjan, R.E.: An O(mlog n ) time algorithm for the maximal planar subgraph. SIAM J.Comput.\u00a022, 1142\u20131162 (1993)","journal-title":"SIAM J.Comput."},{"issue":"4","key":"55_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Battista, G.D., Tamassia, R.: Incremental planarity testing. In: Proc. IEEE Symp. on Found. of Comp. Sci., pp. 436\u2013441 (1989)","DOI":"10.1109\/SFCS.1989.63515"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BFb0015441","volume-title":"Algorithms and Computations","author":"W.L. Hsu","year":"1995","unstructured":"Hsu, W.L.: A linear time algorithm for finding maximal planar subgraphs. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol.\u00a01004, pp. 352\u2013362. Springer, Heidelberg (1995)"},{"issue":"2","key":"55_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/net.3230240203","volume":"24","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Takvorian, A.: An efficient graph planarization two-phase heuristic. Networks\u00a024(2), 69\u201373 (1994)","journal-title":"Networks"},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. Junger","year":"1996","unstructured":"Junger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica\u00a016, 33\u201359 (1996)","journal-title":"Algorithmica"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"M.G.C. Resende","year":"1997","unstructured":"Resende, M.G.C., Ribeiro, C.C.: A GRASP for graph planarization. Networks\u00a029, 173\u2013189 (1997)","journal-title":"Networks"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol.Cybern.\u00a0(52), 141\u2013152 (1985)","DOI":"10.1007\/BF00339943"},{"issue":"4922","key":"55_CR13","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1126\/science.245.4923.1221","volume":"245","author":"Y. Takefuji","year":"1989","unstructured":"Takefuji, Y., Lee, K.C.: A near-optimum parallel planarization algorithmh. Science\u00a0245(4922), 1221\u20131223 (1989)","journal-title":"Science"},{"issue":"12","key":"55_CR14","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1109\/43.103509","volume":"10","author":"Y. Takefuji","year":"1991","unstructured":"Takefuji, Y., Lee, K.C., Cho, Y.B.: Comments on O(n 2) algorithm for graph planarization. IEEE Trans. Comput.-Aided Des. Integer. Circuits Syst.\u00a010(12), 1582\u20131583 (1991)","journal-title":"IEEE Trans. Comput.-Aided Des. Integer. Circuits Syst."},{"issue":"3","key":"55_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/81.989179","volume":"49","author":"R.L. Wang","year":"2002","unstructured":"Wang, R.L., Tang, Z., Cao, Q.P.: An efficient parallel algorithm for planarization problem. IEEE Trans. Circuit Syst. I, Fundam., Theory Appl.\u00a049(3), 101\u2013397 (2002)","journal-title":"IEEE Trans. Circuit Syst. I, Fundam., Theory Appl."},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Wang, R.L., Okazaki, K.: Solving the Graph Planarization problem Using an Improved Genetic Algorithm. IEICE Trans. Fundamentals\u00a0E89-A(5) (May 2006)","DOI":"10.1093\/ietfec\/e89-a.5.1507"},{"key":"55_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R. Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization\u2014An overview. Swarm Intell.\u00a01, 33\u201357 (2007)","journal-title":"Swarm Intell."},{"issue":"4","key":"55_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/S1469026809002710","volume":"8","author":"R.-L. Wang","year":"2009","unstructured":"Wang, R.-L., Okazaki, K.: A two-state ant colony algorithm for solving the minimum graph bisection problem. International Journal of Computational Intelligence and Applications\u00a08(4), 487\u2013498 (2009)","journal-title":"International Journal of Computational Intelligence and Applications"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24553-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T15:46:14Z","timestamp":1686584774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24553-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642245527","9783642245534"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24553-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}