{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:39Z","timestamp":1725664539318},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_106","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:04:15Z","timestamp":1330293855000},"page":"813-817","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Representation of the gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors"],"prefix":"10.1007","author":[{"given":"A. S.","family":"Nepomniaschaya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"106_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-60222-4_99","volume":"964","author":"A. S. Nepomniaschaya","year":"1995","unstructured":"A. Sh. Nepomniaschaya, Comparison of two MST Algorithms for Associative Parallel Processors, in: Proc. of the 3-d Intern. Conf. \u201dParallel Computing Technologies\u201d, PaCT-95, (St. Petersburg, Russia), Lecture Notes in Computer Science, 964, (1995) 85\u201393.","journal-title":"Lecture Notes in Computer Science"},{"issue":"No3","key":"106_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/net.3230080304","volume":"8","author":"H. N. Gabow","year":"1978","unstructured":"H. N. Gabow, A Good Algorithm for Smallest Spanning Trees with a Degree Constraint, in: Networks, 8, No 3, (1978) 201\u2013208.","journal-title":"Networks"},{"key":"106_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","volume":"5","author":"H. N. Gabow","year":"1984","unstructured":"H. N. Gabow, R. E. Tarjan, Efficient Algorithms for a Family of Matroid Intersection Problems, in: J. Algorithms, 5, (1984) 80\u2013131.","journal-title":"J. Algorithms"},{"issue":"No2","key":"106_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. N. Gabow","year":"1986","unstructured":"H. N. Gabow, Z. Galil, T. Spencer, R. E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs, in: Combinatorica\n6, No 2, (1986) 109\u2013122.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:21:58Z","timestamp":1587342118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}