{"id":"https://openalex.org/W1995714268","doi":"https://doi.org/10.1007/s10878-012-9553-0","title":"Faster algorithm to find anti-risk path between two nodes of an undirected graph","display_name":"Faster algorithm to find anti-risk path between two nodes of an undirected graph","publication_year":2012,"publication_date":"2012-10-11","ids":{"openalex":"https://openalex.org/W1995714268","doi":"https://doi.org/10.1007/s10878-012-9553-0","mag":"1995714268"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-012-9553-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-012-9553-0","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/A5074237839","display_name":"Jay Mahadeokar","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Jay Mahadeokar","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 208 016","Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 208 016","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101785418","display_name":"Sanjeev Saxena","orcid":"https://orcid.org/0000-0002-9581-1732"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanjeev Saxena","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 208 016","Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 208 016","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074237839"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.3479,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60456393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"4","first_page":"798","last_page":"807"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9986000061035156,"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.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/fibonacci-number","display_name":"Fibonacci number","score":0.7495601177215576},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7404456734657288},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6872020959854126},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6825912594795227},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6142023801803589},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5196889042854309},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5194284915924072},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5134252309799194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49337735772132874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48448821902275085},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47795844078063965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44391727447509766},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4305228292942047},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4305024743080139},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4193441867828369},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3610575795173645}],"concepts":[{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.7495601177215576},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7404456734657288},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6872020959854126},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6825912594795227},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6142023801803589},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5196889042854309},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5194284915924072},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5134252309799194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49337735772132874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48448821902275085},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47795844078063965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44391727447509766},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4305228292942047},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4305024743080139},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4193441867828369},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3610575795173645},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-012-9553-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-012-9553-0","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:27:y:2014:i:4:d:10.1007_s10878-012-9553-0","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-012-9553-0","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W1519532587","https://openalex.org/W1655990431","https://openalex.org/W1978228527","https://openalex.org/W1980494375","https://openalex.org/W2023658462","https://openalex.org/W2048500523","https://openalex.org/W2056436175","https://openalex.org/W2057084070","https://openalex.org/W2084224084","https://openalex.org/W2090674810","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2920386017","https://openalex.org/W2795454383","https://openalex.org/W4317662907","https://openalex.org/W2054041134","https://openalex.org/W3131374234","https://openalex.org/W1965364641","https://openalex.org/W1995738188","https://openalex.org/W1976803949","https://openalex.org/W2361081252","https://openalex.org/W4230281099"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}