{"id":"https://openalex.org/W2900862090","doi":"https://doi.org/10.1007/s00453-018-0528-0","title":"A Simple Greedy Algorithm for Dynamic Graph Orientation","display_name":"A Simple Greedy Algorithm for Dynamic Graph Orientation","publication_year":2018,"publication_date":"2018-11-20","ids":{"openalex":"https://openalex.org/W2900862090","doi":"https://doi.org/10.1007/s00453-018-0528-0","mag":"2900862090"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0528-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0528-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"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/A5083456517","display_name":"Edvin Berglin","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Edvin Berglin","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083456517"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1725,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82011506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"82","issue":"2","first_page":"245","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.9434634447097778},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7918765544891357},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7593348622322083},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.72089684009552},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6927964687347412},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6551182270050049},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.465553343296051},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46306437253952026},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45939064025878906},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.45036008954048157},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.422477662563324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3941916227340698},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2573429346084595},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21474209427833557},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1761835515499115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1580796241760254},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.15255069732666016}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.9434634447097778},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7918765544891357},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7593348622322083},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.72089684009552},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6927964687347412},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6551182270050049},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.465553343296051},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46306437253952026},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45939064025878906},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.45036008954048157},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.422477662563324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3941916227340698},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2573429346084595},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21474209427833557},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1761835515499115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1580796241760254},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.15255069732666016},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-018-0528-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0528-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/f8868a34-506c-486d-b7d7-0de4ca367277","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/f8868a34-506c-486d-b7d7-0de4ca367277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berglin, E & Brodal, G S 2020, 'A Simple Greedy Algorithm for Dynamic Graph Orientation', Algorithmica, vol. 82, no. 2, pp. 245-259. https://doi.org/10.1007/s00453-018-0528-0","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2079292181","display_name":null,"funder_award_id":"DNRF8","funder_id":"https://openalex.org/F4320320943","funder_display_name":"Danmarks Grundforskningsfond"},{"id":"https://openalex.org/G3034753964","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"},{"id":"https://openalex.org/G4045262781","display_name":null,"funder_award_id":"DNRF84","funder_id":"https://openalex.org/F4320320943","funder_display_name":"Danmarks Grundforskningsfond"},{"id":"https://openalex.org/G7979426425","display_name":null,"funder_award_id":"DNRF84","funder_id":"https://openalex.org/F4320324281","funder_display_name":"Center for Massive Data Algorithmics"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320943","display_name":"Danmarks Grundforskningsfond","ror":"https://ror.org/00znyv691"},{"id":"https://openalex.org/F4320324281","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1501843896","https://openalex.org/W1524840666","https://openalex.org/W2026511056","https://openalex.org/W2041955583","https://openalex.org/W2060963839","https://openalex.org/W2134458085","https://openalex.org/W2164648353","https://openalex.org/W2182065913","https://openalex.org/W2244920958","https://openalex.org/W2261727491","https://openalex.org/W4235789583","https://openalex.org/W4250173201"],"related_works":["https://openalex.org/W4289666645","https://openalex.org/W2950893338","https://openalex.org/W2467514673","https://openalex.org/W2886745396","https://openalex.org/W2748289508","https://openalex.org/W4388032032","https://openalex.org/W4378895278","https://openalex.org/W2041955583","https://openalex.org/W2784019526","https://openalex.org/W2900862090"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}