{"id":"https://openalex.org/W1483949697","doi":"https://doi.org/10.48550/arxiv.1012.0058","title":"Modelling dynamic programming problems by generalized d-graphs","display_name":"Modelling dynamic programming problems by generalized d-graphs","publication_year":2010,"publication_date":"2010-11-30","ids":{"openalex":"https://openalex.org/W1483949697","doi":"https://doi.org/10.48550/arxiv.1012.0058","mag":"1483949697"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1012.0058","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.0058","pdf_url":"https://arxiv.org/pdf/1012.0058","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1012.0058","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050474737","display_name":"Zolt\u00e1n K\u00e1tai","orcid":"https://orcid.org/0000-0003-2343-3629","observed_orcids":["https://orcid.org/0000-0003-2343-3629"]},"institutions":[{"id":"https://openalex.org/I4210167006","display_name":"St. Thomas University","ror":"https://ror.org/022mc7478","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210167006"]},{"id":"https://openalex.org/I43886","display_name":"Sapientia Hungarian University of Transylvania","ror":"https://ror.org/04ahh4d11","country_code":"RO","type":"education","lineage":["https://openalex.org/I43886"]}],"countries":["JP","RO"],"is_corresponding":true,"raw_author_name":"K\u00e1tai, Zolt\u00e1n","raw_affiliation_strings":["Sapientia Hungarian University of Transylvania Department of Mathematics and Informatics , Tg. Mure\u015f , Romania","Sapientia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapientia Hungarian University of Transylvania Department of Mathematics and Informatics , Tg. Mure\u015f , Romania","institution_ids":["https://openalex.org/I43886"]},{"raw_affiliation_string":"Sapientia University","institution_ids":["https://openalex.org/I4210167006"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050474737"],"corresponding_institution_ids":["https://openalex.org/I4210167006","https://openalex.org/I43886"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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":0.9984999895095825,"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":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0007999999797903001,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0006000000284984708,"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/dynamic-programming","display_name":"dynamic programming","score":0.8560000061988831},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"dependency graph","score":0.9779999852180481},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.6930000185966492},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.8840000033378601},{"id":"https://openalex.org/keywords/bellman-ford-algorithm","display_name":"Bellman-Ford algorithm","score":0.9980000257492065},{"id":"https://openalex.org/keywords/topological-order","display_name":"topological order","score":0.9160000085830688},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.460999995470047}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7161668539047241},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.559019923210144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5389266014099121},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45586279034614563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45149466395378113},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.411859393119812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33756107091903687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31975042819976807},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30950942635536194}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1012.0058","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.0058","pdf_url":"https://arxiv.org/pdf/1012.0058","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:1483949697","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1012.0058","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1012.0058","doi":"https://doi.org/10.48550/arxiv.1012.0058","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1012.0058","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1012.0058","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.0058","pdf_url":"https://arxiv.org/pdf/1012.0058","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320329446","display_name":"Universitatea Sapientia","ror":"https://ror.org/04ahh4d11"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1483949697.pdf","grobid_xml":"https://content.openalex.org/works/W1483949697.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W345900361","https://openalex.org/W1517411378","https://openalex.org/W1533388479","https://openalex.org/W1589991875","https://openalex.org/W1938058722","https://openalex.org/W2062533874","https://openalex.org/W2144050658","https://openalex.org/W2168311572","https://openalex.org/W2341171179","https://openalex.org/W2499471145","https://openalex.org/W2547786246","https://openalex.org/W3145128584","https://openalex.org/W3214380909"],"related_works":["https://openalex.org/W6999751878","https://openalex.org/W7100849869","https://openalex.org/W4403948885","https://openalex.org/W3175469323","https://openalex.org/W2373494658","https://openalex.org/W7100421534","https://openalex.org/W2794328882","https://openalex.org/W3114273773","https://openalex.org/W1485398492","https://openalex.org/W1517411378"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"introduce":[4],"the":[5,23,36,40,56,77],"concept":[6],"of":[7,26,39,58,62,83],"generalized":[8],"d-graph":[9,24],"(admitting":[10],"cycles)":[11],"as":[12,51],"special":[13],"dependency-graphs":[14],"for":[15],"modelling":[16,67],"dynamic":[17],"programming":[18],"(DP)":[19],"problems.":[20,64],"We":[21],"describe":[22],"versions":[25],"three":[27,59],"famous":[28],"single-source":[29],"shortest":[30],"algorithms":[31],"(The":[32],"algorithm":[33,43],"based":[34],"on":[35],"topological":[37],"order":[38],"vertices,":[41],"Dijkstra":[42],"and":[44,76],"Bellman-Ford":[45],"algorithm),":[46],"which":[47],"can":[48],"be":[49],"viewed":[50],"general":[52],"DP":[53,74,79],"strategies":[54,80],"in":[55,81],"case":[57],"different":[60],"class":[61],"optimization":[63],"The":[65],"new":[66],"method":[68],"also":[69],"makes":[70],"possible":[71],"to":[72],"classify":[73],"problems":[75],"corresponding":[78],"term":[82],"graph":[84],"theory.":[85]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}