{"id":"https://openalex.org/W2990887334","doi":null,"title":"Successive Shortest Path Algorithm for Flows in Dynamic Graphs","display_name":"Successive Shortest Path Algorithm for Flows in Dynamic Graphs","publication_year":2018,"publication_date":"2018-06-18","ids":{"openalex":"https://openalex.org/W2990887334","mag":"2990887334"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-02115408v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-02115408","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cologne Twente Workshop, Jun 2018, Paris, France","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5068480008","display_name":"Mathilde Vernet","orcid":"https://orcid.org/0000-0002-9884-5970","observed_orcids":["https://orcid.org/0000-0002-9884-5970"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vernet, Mathilde","raw_affiliation_strings":["Equipe R\u00e9seaux d'interactions et Intelligence Collective"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe R\u00e9seaux d'interactions et Intelligence Collective","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056380163","display_name":"Maciej Drozdowski","orcid":"https://orcid.org/0000-0001-9314-529X","observed_orcids":["https://orcid.org/0000-0001-9314-529X"]},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Drozdowski, Maciej","raw_affiliation_strings":["Institute of Computing Science [Poznan]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computing Science [Poznan]","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037237403","display_name":"Yoann Pign\u00e9","orcid":"https://orcid.org/0000-0002-3570-7490","observed_orcids":["https://orcid.org/0000-0002-3570-7490"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pign\u00e9, Yoann","raw_affiliation_strings":["Equipe R\u00e9seaux d'interactions et Intelligence Collective"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe R\u00e9seaux d'interactions et Intelligence Collective","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024652312","display_name":"\u00c9ric Sanlaville","orcid":"https://orcid.org/0000-0001-9482-3945","observed_orcids":["https://orcid.org/0000-0001-9482-3945"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanlaville, Eric","raw_affiliation_strings":["Equipe R\u00e9seaux d'interactions et Intelligence Collective"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe R\u00e9seaux d'interactions et Intelligence Collective","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2299,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.33230558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"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/minimum-cost-flow","display_name":"minimum cost flow","score":0.9039999842643738},{"id":"https://openalex.org/keywords/dynamic-graphs","display_name":"dynamic graphs","score":0.9819999933242798},{"id":"https://openalex.org/keywords/time-expanded-graph","display_name":"time-expanded graph","score":0.6919999718666077},{"id":"https://openalex.org/keywords/flow-networks","display_name":"flow networks","score":0.30399999022483826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6211535930633545},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.598444402217865},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.595053493976593},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.511127769947052},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5007219314575195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48136526346206665},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44948986172676086},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4219014048576355},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4208185374736786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3135683834552765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20392155647277832},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09702140092849731}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:HAL:hal-02115408v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-02115408","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cologne Twente Workshop, Jun 2018, Paris, France","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2999068266","https://openalex.org/W1982800744","https://openalex.org/W1922258106","https://openalex.org/W3114273773","https://openalex.org/W2354942473","https://openalex.org/W2126125208","https://openalex.org/W4414057393","https://openalex.org/W1583428620","https://openalex.org/W2185752976","https://openalex.org/W2259273609"],"abstract_inverted_index":{"This":[0],"work":[1],"focuses":[2],"on":[3,23,27],"the":[4,43,51,57,60,67],"minimum":[5],"cost":[6],"flow":[7],"problem":[8],"in":[9,16],"dynamic":[10],"graphs.":[11],"We":[12,38],"use":[13],"a":[14,40],"model":[15],"which":[17],"there":[18],"are":[19],"no":[20],"travel":[21],"time":[22],"arcs,":[24],"and":[25],"storage":[26],"vertices":[28],"is":[29,36,64],"not":[30],"allowed.":[31],"Every":[32],"other":[33],"graph":[34,53],"parameter":[35],"time-dependent.":[37],"propose":[39],"method":[41,63],"using":[42,50,66],"successive":[44],"shortest":[45],"path":[46],"algorithm":[47],"that":[48,54],"avoids":[49],"time-expanded":[52],"significantly":[55],"increases":[56],"complexity":[58],"of":[59],"problem.":[61],"Our":[62],"implemented":[65],"GraphStream":[68],"library.":[69]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2019-12-05T00:00:00"}