{"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":"conference-paper","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.2723,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42992126,"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":{"pdf":false,"grobid_xml":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,142],"=":[2,14,18],"(V,":[3],"E)":[4],"be":[5],"a":[6,21,27,32,50,54,103,138,166,199],"connected,":[7],"weighted,":[8],"undirected":[9],"graph":[10,38,140],"such":[11],"that":[12,66],"|V|":[13],"n":[15],"and":[16,31,46,150,157],"|E|":[17],"m.":[19],"Given":[20],"shortest":[22,42,91,115,168,201],"path":[23,43,169,202],"Pg(s,":[24,58,82,174],"t)":[25,59,83,107,175,208],"between":[26,44],"source":[28,45],"node":[29,34,104,205],"s":[30],"sink":[33,47],"t":[35],"in":[36,57,81,87,105,111,159,173,206],"the":[37,41,88,94,112,121,153,181],"G,":[39],"computing":[40],"without":[48,176,209],"using":[49],"particular":[51,55],"edge":[52,67,80,172],"(or":[53,68],"node)":[56],"is":[60,76,100],"called":[61],"Replacement":[62],"Shortest":[63],"Path":[64],"for":[65,120,170,203],"node).":[69],"The":[70],"Most":[71,95],"Vital":[72,96],"Edge":[73],"(MVE)":[74],"problem":[75,99,123],"to":[77,101],"find":[78,102],"an":[79,126,189],"whose":[84,108],"removal":[85,109],"results":[86,110],"longest":[89,113],"replacement":[90,114,167,200],"path.":[92,116],"And":[93],"Node":[97],"(MVN)":[98],"PG(s,":[106,207],"In":[117],"this":[118],"paper":[119],"MVE":[122],"we":[124,144,187],"describe":[125,188],"O(m+m'a(m',":[127],"n'))":[128],"time":[129,192],"algorithm":[130,162,195],"(\u03b1":[131],"represents":[132],"Inverse":[133],"Ackermann":[134],"function)":[135],"by":[136],"constructing":[137],"smaller":[139],"LGfrom":[141],"which":[143],"call":[145],"Linear":[146],"Graph,":[147],"where":[148],"n'":[149],"m'":[151],"are":[152],"number":[154],"of":[155],"nodes":[156],"edges":[158],"LGrespectively.":[160],"Our":[161,194],"will":[163,196],"also":[164,197],"suggest":[165,198],"every":[171,204],"any":[177,210],"additional":[178,211],"time.":[179,212],"For":[180],"MVN":[182],"problem,":[183],"with":[184],"integer":[185],"weights,":[186],"O(m\u03b1(m,":[190],"n))":[191],"algorithm.":[193]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}