乐胖代购免代理版

{"id":"https://openalex.org/W2084763084","doi":"https://doi.org/10.1145/1187436.1210590","title":"A dynamic topological sort algorithm for directed acyclic graphs","display_name":"A dynamic topological sort algorithm for directed acyclic graphs","publication_year":2007,"publication_date":"2007-02-09","ids":{"openalex":"https://openalex.org/W2084763084","doi":"https://doi.org/10.1145/1187436.1210590","mag":"2084763084"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1210590","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008538442","display_name":"David J. Pearce","orcid":"https://orcid.org/0000-0003-4535-9677"},"institutions":[{"id":"https://openalex.org/I41156924","display_name":"Victoria University of Wellington","ror":"https://ror.org/0040r6f76","country_code":"NZ","type":"education","lineage":["https://openalex.org/I41156924"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"David J. Pearce","raw_affiliation_strings":["Victoria University of Wellington, Wellington, New Zealand"],"affiliations":[{"raw_affiliation_string":"Victoria University of Wellington, Wellington, New Zealand","institution_ids":["https://openalex.org/I41156924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000319133","display_name":"Paul H. J. Kelly","orcid":"https://orcid.org/0000-0001-5905-1804"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul H. J. Kelly","raw_affiliation_strings":["Imperial College, London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Imperial College, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.249,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":86,"citation_normalized_percentile":{"value":0.999881,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"11","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9951,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9951,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.994,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9921,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.89467406},{"id":"https://openalex.org/keywords/moral-graph","display_name":"Moral graph","score":0.52837205}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.92041564},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.89467406},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6651147},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.52837205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5137516},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5026915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48198217},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42809752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41592157},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37172067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35515395},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0961715},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08116338},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07447317}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1210590","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":41,"referenced_works":["https://openalex.org/W1499442191","https://openalex.org/W1512043027","https://openalex.org/W1518021176","https://openalex.org/W1519800400","https://openalex.org/W1544685773","https://openalex.org/W1546014544","https://openalex.org/W1569643709","https://openalex.org/W1572663059","https://openalex.org/W1601726608","https://openalex.org/W1612498707","https://openalex.org/W1676865579","https://openalex.org/W1970448777","https://openalex.org/W1988846076","https://openalex.org/W2006906930","https://openalex.org/W2007626053","https://openalex.org/W2008593246","https://openalex.org/W2022086557","https://openalex.org/W2026511056","https://openalex.org/W2033272649","https://openalex.org/W2044040096","https://openalex.org/W2044735058","https://openalex.org/W2045102550","https://openalex.org/W2045768854","https://openalex.org/W2049354208","https://openalex.org/W2060607751","https://openalex.org/W2067247412","https://openalex.org/W2084472818","https://openalex.org/W2085227596","https://openalex.org/W2094724468","https://openalex.org/W2097147952","https://openalex.org/W2134890818","https://openalex.org/W2140055897","https://openalex.org/W2148411689","https://openalex.org/W2151543040","https://openalex.org/W2321452898","https://openalex.org/W2478722229","https://openalex.org/W3142570770","https://openalex.org/W3144881883","https://openalex.org/W3145128584","https://openalex.org/W4244805165","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288723498","https://openalex.org/W2728444714","https://openalex.org/W2555805899","https://openalex.org/W2382500328","https://openalex.org/W2374089414","https://openalex.org/W2366316694","https://openalex.org/W2318219045","https://openalex.org/W2094521181","https://openalex.org/W2084763084","https://openalex.org/W1519800400"],"abstract_inverted_index":{"We":[0,23],"consider":[1],"the":[2,6,16,37,61,78,90],"problem":[3],"of":[4,9,18,69],"maintaining":[5],"topological":[7],"order":[8],"a":[10,25,66,85],"directed":[11],"acyclic":[12],"graph":[13],"(DAG)":[14],"in":[15,51],"presence":[17],"edge":[19],"insertions":[20],"and":[21,83],"deletions.":[22],"present":[24],"new":[26],"algorithm":[27,76],"and,":[28],"although":[29],"this":[30],"has":[31],"inferior":[32],"time":[33],"complexity":[34],"compared":[35],"with":[36],"best":[38,79,91],"previously":[39],"known":[40],"result,":[41],"we":[42,55],"find":[43],"that":[44],"its":[45],"simplicity":[46],"leads":[47],"to":[48],"better":[49],"performance":[50],"practice.":[52],"In":[53],"addition,":[54],"provide":[56],"an":[57],"empirical":[58],"comparison":[59],"against":[60],"three":[62],"main":[63],"alternatives":[64],"over":[65],"large":[67],"number":[68],"random":[70],"DAGs.":[71],"The":[72],"results":[73],"show":[74],"our":[75],"is":[77],"for":[80],"sparse":[81],"digraphs":[82],"only":[84],"constant":[86],"factor":[87],"slower":[88],"than":[89],"on":[92],"dense":[93],"digraphs.":[94]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2084763084","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2025-01-06T23:11:02.290271","created_date":"2016-06-24"}