{"id":"https://openalex.org/W1991421987","doi":"https://doi.org/10.1109/ic3.2013.6612164","title":"Efficient solutions for finding vitality with respect to shortest paths","display_name":"Efficient solutions for finding vitality with respect to shortest paths","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W1991421987","doi":"https://doi.org/10.1109/ic3.2013.6612164","mag":"1991421987"},"language":"en","primary_location":{"id":"doi:10.1109/ic3.2013.6612164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2013.6612164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Sixth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-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/A5055647664","display_name":"Anjeneya Swami Kare","orcid":"https://orcid.org/0000-0003-3644-4802"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anjeneya Swami Kare","raw_affiliation_strings":["School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Andhra Pradesh, India","School of Computer and Information Science, University of Hyderabad, Hyderabad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Andhra Pradesh, India","institution_ids":["https://openalex.org/I36893310"]},{"raw_affiliation_string":"School of Computer and Information Science, University of Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]},{"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":["Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur, Uttar Pradesh, India","Department of Computer Science and Engineering, Indian Institute of Technology-Kanpur, Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur, Uttar Pradesh, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology-Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3725,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62988884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3580","issue":null,"first_page":"70","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9840999841690063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7145062685012817},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5726828575134277},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5269263982772827},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4923456907272339},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.4922308027744293},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44037926197052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41995155811309814},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4146678149700165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37476277351379395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34717410802841187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34485337138175964},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10871288180351257},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08300760388374329}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7145062685012817},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5726828575134277},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5269263982772827},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4923456907272339},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.4922308027744293},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44037926197052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41995155811309814},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4146678149700165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37476277351379395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34717410802841187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34485337138175964},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10871288180351257},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08300760388374329},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic3.2013.6612164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2013.6612164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Sixth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W115237389","https://openalex.org/W1773616669","https://openalex.org/W1964948588","https://openalex.org/W1978228527","https://openalex.org/W1980943820","https://openalex.org/W2000869287","https://openalex.org/W2008423363","https://openalex.org/W2023658462","https://openalex.org/W2073094163","https://openalex.org/W2076163262","https://openalex.org/W2134729426","https://openalex.org/W2164276198","https://openalex.org/W2170581050","https://openalex.org/W4245095675","https://openalex.org/W6637727127","https://openalex.org/W6685239999"],"related_works":["https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W4388435768","https://openalex.org/W2756792282","https://openalex.org/W2756744637","https://openalex.org/W2759493398","https://openalex.org/W3216309640","https://openalex.org/W2807877113","https://openalex.org/W4254767272","https://openalex.org/W2026076591"],"abstract_inverted_index":{"Let":[0],"G":[1,162],"=":[2,14,18],"(V,":[3],"E)":[4],"be":[5],"a":[6,21,31,36,54,58,115,154,190,227],"connected,":[7],"weighted,":[8],"undirected":[9],"graph":[10,42,156],"such":[11],"that":[12,74],"|V|":[13],"n":[15],"and":[16,35,50,170,177],"|E|":[17],"m.":[19],"Given":[20],"shortest":[22,46,103,131,192,229],"path":[23,47,193,230],"P":[24,62,90,118,198,235],"<sub":[25,63,91,119,158,181,199,236],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[26,64,92,120,159,182,200,237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">g</sub>":[27,65,93,201],"(s,":[28,66,94,122,202,239],"t)":[29,67,95,123,203,240],"between":[30,48],"source":[32,49],"node":[33,38,116,233],"s":[34],"sink":[37,51],"t":[39],"in":[40,61,89,99,117,127,179,197,234],"the":[41,45,100,106,128,137,173,209],"G,":[43],"computing":[44],"without":[52,204,241],"using":[53],"particular":[55,59],"edge":[56,75,88,196],"(or":[57,76],"node)":[60],"is":[68,84,112],"called":[69],"Replacement":[70],"Shortest":[71],"Path":[72],"for":[73,136,194,231],"node).":[77],"The":[78],"Most":[79,107],"Vital":[80,108],"Edge":[81],"(MVE)":[82],"problem":[83,111,139],"to":[85,113],"find":[86,114],"an":[87,142,217],"whose":[96,124],"removal":[97,125],"results":[98,126],"longest":[101,129],"replacement":[102,130,191,228],"path.":[104,132],"And":[105],"Node":[109],"(MVN)":[110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</sub>":[121,160,183,238],"In":[133],"this":[134],"paper":[135],"MVE":[138],"we":[140,164,215],"describe":[141,216],"O(m+m'a(m',":[143],"n'))":[144],"time":[145,220],"algorithm":[146,186,223],"(\u03b1":[147],"represents":[148],"Inverse":[149],"Ackermann":[150],"function)":[151],"by":[152],"constructing":[153],"smaller":[155],"L":[157,180],"from":[161],"which":[163],"call":[165],"Linear":[166],"Graph,":[167],"where":[168],"n'":[169],"m'":[171],"are":[172],"number":[174],"of":[175],"nodes":[176],"edges":[178],"respectively.":[184],"Our":[185,222],"will":[187,224],"also":[188,225],"suggest":[189,226],"every":[195,232],"any":[205,242],"additional":[206,243],"time.":[207,244],"For":[208],"MVN":[210],"problem,":[211],"with":[212],"integer":[213],"weights,":[214],"O(m\u03b1(m,":[218],"n))":[219],"algorithm.":[221]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}