{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T05:10:06Z","timestamp":1693372206652},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1999,6]]},"abstract":"<jats:p> The problem of partitioning a graph such that the number of edges incident to vertices in different partitions is minimized, arises in many contexts. Some examples include its recursive application for minimizing fill-in in matrix factorizations and load-balancing for parallel algorithms. Spectral graph partitioning algorithms partition a graph using the eigenvector associated with the second smallest eigenvalue of a matrix called the graph Laplacian. The focus of this paper is the use graph theory to compute this eigenvector more quickly. <\/jats:p>","DOI":"10.1142\/s0129054199000162","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:05:54Z","timestamp":1027767954000},"page":"225-246","source":"Crossref","is-referenced-by-count":7,"title":["A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM"],"prefix":"10.1142","volume":"10","author":[{"given":"MICHAEL","family":"HOLZRICHTER","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM 5800, USA"}]},{"given":"SUELY","family":"OLIVEIRA","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, The University of Iowa, Iowa City, IA 52242, USA"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285771"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680020402"},{"key":"p_4","volume":"763","author":"Borges L.","year":"1998","journal-title":"Journal of Computational Physics, (144)"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(75)90065-0"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(89)90147-1"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1080\/10637199608915575"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01591018"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989427470X"},{"key":"p_16","first-page":"87185","author":"Hendrickson B.","year":"1994","journal-title":"NM"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054199000162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:37:34Z","timestamp":1565095054000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054199000162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[1999,6]]}},"alternative-id":["10.1142\/S0129054199000162"],"URL":"https:\/\/doi.org\/10.1142\/s0129054199000162","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}