{"id":"https://openalex.org/W2124973622","doi":"https://doi.org/10.1007/3-540-61626-8_106","title":"Representation of the gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors","display_name":"Representation of the gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2124973622","doi":"https://doi.org/10.1007/3-540-61626-8_106","mag":"2124973622"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61626-8_106","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-61626-8_106","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-61626-8_106.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/3-540-61626-8_106.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065826034","display_name":"Anna Nepomniaschaya","orcid":"https://orcid.org/0000-0001-8386-5402"},"institutions":[{"id":"https://openalex.org/I4210143490","display_name":"Computing Center","ror":"https://ror.org/0557kgc34","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210143490","https://openalex.org/I4210148470"]},{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. S. Nepomniaschaya","raw_affiliation_strings":["Supercomputer Software Department, Computing Center, Siberian Division of Russian Academy of Sciences, pr. Lavrentieva, 6, 630090, Novosibirsk, Russia","Supercomputer Software Department, Computing Center, Siberian Division of Russian Academy of Sciences, Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Supercomputer Software Department, Computing Center, Siberian Division of Russian Academy of Sciences, pr. Lavrentieva, 6, 630090, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210143490","https://openalex.org/I1313323035"]},{"raw_affiliation_string":"Supercomputer Software Department, Computing Center, Siberian Division of Russian Academy of Sciences, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210143490","https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065826034"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210143490"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4194,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61777033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"813","last_page":"817"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14470","display_name":"Advanced Data Processing Techniques","score":0.9635999798774719,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.786729097366333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7677483558654785},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7636997699737549},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6756948232650757},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6007466316223145},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5620602965354919},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5233770608901978},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48368316888809204},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.47873350977897644},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.46388939023017883},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.43105295300483704},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4301992654800415},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4074832797050476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3962550163269043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21776056289672852},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2138630747795105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20036324858665466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19166314601898193},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.16380316019058228}],"concepts":[{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.786729097366333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7677483558654785},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7636997699737549},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6756948232650757},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6007466316223145},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5620602965354919},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5233770608901978},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48368316888809204},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.47873350977897644},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.46388939023017883},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.43105295300483704},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4301992654800415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4074832797050476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3962550163269043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21776056289672852},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2138630747795105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20036324858665466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19166314601898193},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.16380316019058228},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-61626-8_106","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-61626-8_106","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-61626-8_106.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/3-540-61626-8_106","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-61626-8_106","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-61626-8_106.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2124973622.pdf","grobid_xml":"https://content.openalex.org/works/W2124973622.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1529771304","https://openalex.org/W1982512167","https://openalex.org/W1992122785","https://openalex.org/W2033250446","https://openalex.org/W2036940456"],"related_works":["https://openalex.org/W2803918337","https://openalex.org/W2099915933","https://openalex.org/W2015718828","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W3016811403","https://openalex.org/W2352525723","https://openalex.org/W2010585027"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}