{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:07:04Z","timestamp":1649192824053},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,7]],"date-time":"2011-05-07T00:00:00Z","timestamp":1304726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10852-011-9154-4","type":"journal-article","created":{"date-parts":[[2011,5,6]],"date-time":"2011-05-06T08:24:15Z","timestamp":1304670255000},"page":"269-276","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure"],"prefix":"10.1007","volume":"10","author":[{"given":"Yourim","family":"Yoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Hyuk","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,7]]},"reference":[{"issue":"1\u20132","key":"9154_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"CJ Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integration, the VLSI Journal 19(1\u20132), 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"issue":"3","key":"9154_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3), 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9154_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(92)90126-G","volume":"42","author":"LH Clark","year":"1992","unstructured":"Clark, L.H., Shahrokhi, F., Sz\u00e9kely, L.A.: A linear time algorithm for graph partition problems. Inf. Process. Lett. 42(1), 19\u201324 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9154_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00189-7","volume":"79","author":"U Feige","year":"2001","unstructured":"Feige, U., Karpinski, M., Langberg, M.: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4), 181\u2013188 (2001)","journal-title":"Inf. Process. Lett."},{"key":"9154_CR5","unstructured":"Fj\u00e4llstr\u00f6m, P.O.: Algorithms for graph partitioning: a survey. In: Linkoping Electronic Articles in Computer and Information Science, vol. 3 (1998)"},{"issue":"9","key":"9154_CR6","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 11(9), 1074\u20131085 (1992)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"9154_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:HEUR.0000019985.94952.eb","volume":"10","author":"Y-H Kim","year":"2004","unstructured":"Kim, Y.-H., Moon, B.-R.: Lock-gain based graph partitioning. Journal of Heuristics 10(1), 37\u201357 (2004)","journal-title":"Journal of Heuristics"},{"issue":"2\u20133","key":"9154_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(94)00103-K","volume":"57","author":"L Ku\u010dera","year":"1995","unstructured":"Ku\u010dera, L.: Expected complexity of graph partitioning problems. Discrete Appl. Math. 57(2\u20133), 193\u2013212 (1995)","journal-title":"Discrete Appl. Math."},{"key":"9154_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0024-3795(88)90147-4","volume":"101","author":"DL Powers","year":"1988","unstructured":"Powers, D.L.: Graph partitioning by eigenvectors. Linear Algebra Appl. 101, 121\u2013133 (1988)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"9154_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(94)00148-0","volume":"52","author":"J-T Yan","year":"1994","unstructured":"Yan, J.-T., Hsiao, P.-Y.: A fuzzy clustering algorithm for graph bisection. Inf. Process. Lett. 52(5), 259\u2013263 (1994)","journal-title":"Inf. Process. Lett."},{"key":"9154_CR11","unstructured":"Antonio, S.M., Abraham, D., Juan, J.P., Ra\u00fal, C.: High-performance VNS for the max-cut problem using commodity graphics hardware. In: Proceedings of the 18th Mini Euro Conference on VNS (2005)"},{"issue":"4","key":"9154_CR12","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/43.494703","volume":"15","author":"J Cong","year":"1996","unstructured":"Cong, J., Labio, W.J., Shivakumar, N.: Multiway VLSI circuit partitioning based on dual net representation. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 15(4), 396\u2013409 (1996)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"9154_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1137\/S0895479896312262","volume":"19","author":"S Guattery","year":"1998","unstructured":"Guattery, S., Miller, G.L.: On the quality of spectral separators. SIAM J. Matrix Anal. Appl. 19(3), 701\u2013719 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9154_CR14","doi-asserted-by":"crossref","unstructured":"Michel, J., Pellegrini, F., Roman, J.: Unstructured graph partitioning for sparse linear system solving. In: Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 273\u2013286 (1997)","DOI":"10.1007\/3-540-63138-0_23"},{"key":"9154_CR15","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1142\/S0129053394000160","volume":"6","author":"V Venkatakrishnan","year":"1994","unstructured":"Venkatakrishnan, V.: Parallel computation of Ax and A T x. Int. J. High Speed Comput. 6, 325\u2013342 (1994)","journal-title":"Int. J. High Speed Comput."},{"key":"9154_CR16","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"15","author":"KD Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 15, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"9154_CR17","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184\u2013192 (1995)"},{"key":"9154_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01759051","volume":"6","author":"GB Sorkin","year":"1991","unstructured":"Sorkin, G.B.: Efficient simulated annealing on fractal landscapes. Algorithmica 6, 367\u2013418 (1991)","journal-title":"Algorithmica"},{"key":"9154_CR19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00216965","volume":"65","author":"ED Weinberger","year":"1991","unstructured":"Weinberger, E.D.: Fourier and Taylor series on fitness landscapes. Biol. Cybern. 65, 321\u2013330 (1991)","journal-title":"Biol. Cybern."},{"issue":"6","key":"9154_CR20","first-page":"339","volume":"7","author":"Y-H Kim","year":"2008","unstructured":"Kim, Y.-H., Seo, K.: Two congruence classes for symmetric binary matrices over $\\mathbb{F}_2$ . WSEAS Trans. Math. 7(6), 339\u2013343 (2008)","journal-title":"WSEAS Trans. Math."},{"key":"9154_CR21","doi-asserted-by":"crossref","unstructured":"Biggs, N.L.: Algebraic Graph Theory. Cambridge University Press (1974)","DOI":"10.1017\/CBO9780511608704"},{"key":"9154_CR22","volume-title":"Graph Theory, Number 173 in Graduate Texts in Mathematics","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, Number 173 in Graduate Texts in Mathematics, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"9154_CR23","unstructured":"Hoffman, D.G., Leonard, D.A., Lidner, C.C., Phelps, K.T., Rodger, C.A., Wall, J.R.: Coding Theory: The Essentials. Marcel Dekker (1991)"},{"key":"9154_CR24","doi-asserted-by":"crossref","unstructured":"van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer (1998)","DOI":"10.1007\/978-3-642-58575-3"},{"key":"9154_CR25","doi-asserted-by":"crossref","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Jetchev, N., Martin, A.: Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem. In: Evolutionary Computation in Combinatorial Optimization, pp. 1\u201312 (2006)","DOI":"10.1007\/11730095_1"},{"key":"9154_CR26","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison Wesley (1974)"},{"key":"9154_CR27","doi-asserted-by":"crossref","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"issue":"6","key":"9154_CR28","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9154-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-011-9154-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9154-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T15:35:40Z","timestamp":1560180940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-011-9154-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,7]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9154"],"URL":"https:\/\/doi.org\/10.1007\/s10852-011-9154-4","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,7]]}}}