{"id":"https://openalex.org/W755651516","doi":"https://doi.org/10.1007/s10878-015-9912-8","title":"Finding a contra-risk path between two nodes in undirected graphs","display_name":"Finding a contra-risk path between two nodes in undirected graphs","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W755651516","doi":"https://doi.org/10.1007/s10878-015-9912-8","mag":"755651516"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-015-9912-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9912-8","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5103241686","display_name":"Mehdi Ghiyasvand","orcid":"https://orcid.org/0000-0001-8357-7857"},"institutions":[{"id":"https://openalex.org/I167694869","display_name":"Bu-Ali Sina University","ror":"https://ror.org/04ka8rx28","country_code":"IR","type":"education","lineage":["https://openalex.org/I167694869"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mehdi Ghiyasvand","raw_affiliation_strings":["Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran","Department of Mathematics, Faculty of Science Bu-Ali Sina University Hamedan Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran","institution_ids":["https://openalex.org/I167694869"]},{"raw_affiliation_string":"Department of Mathematics, Faculty of Science Bu-Ali Sina University Hamedan Iran","institution_ids":["https://openalex.org/I167694869"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016516441","display_name":"Iman Keshtkar","orcid":null},"institutions":[{"id":"https://openalex.org/I167694869","display_name":"Bu-Ali Sina University","ror":"https://ror.org/04ka8rx28","country_code":"IR","type":"education","lineage":["https://openalex.org/I167694869"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Iman Keshtkar","raw_affiliation_strings":["Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran","Department of Mathematics, Faculty of Science Bu-Ali Sina University Hamedan Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran","institution_ids":["https://openalex.org/I167694869"]},{"raw_affiliation_string":"Department of Mathematics, Faculty of Science Bu-Ali Sina University Hamedan Iran","institution_ids":["https://openalex.org/I167694869"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103241686"],"corresponding_institution_ids":["https://openalex.org/I167694869"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00791064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":"3","first_page":"917","last_page":"926"},"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.9975000023841858,"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.9975000023841858,"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.9921000003814697,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/path","display_name":"Path (computing)","score":0.656003475189209},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6468433141708374},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5594877004623413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5324795246124268},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5110303163528442},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47678235173225403},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4716488718986511},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.45887625217437744},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44002389907836914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4293926954269409},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36827391386032104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3278752863407135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20836180448532104},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11477318406105042},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09920883178710938}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.656003475189209},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6468433141708374},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5594877004623413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5324795246124268},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5110303163528442},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47678235173225403},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4716488718986511},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.45887625217437744},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44002389907836914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4293926954269409},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36827391386032104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3278752863407135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20836180448532104},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11477318406105042},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09920883178710938},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-015-9912-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9912-8","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:32:y:2016:i:3:d:10.1007_s10878-015-9912-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-015-9912-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1564217339","https://openalex.org/W1977545325","https://openalex.org/W1978228527","https://openalex.org/W1980494375","https://openalex.org/W1980943820","https://openalex.org/W1995714268","https://openalex.org/W2039634593","https://openalex.org/W2056436175","https://openalex.org/W2134948830","https://openalex.org/W4245095675"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W4299588719","https://openalex.org/W2020255949","https://openalex.org/W2375775343","https://openalex.org/W1817899449","https://openalex.org/W4382866750","https://openalex.org/W2600678155","https://openalex.org/W2388410942"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}