{"id":"https://openalex.org/W197854957","doi":null,"title":"On Linear time algoritm for SSSP Problem","display_name":"On Linear time algoritm for SSSP Problem","alternate_titles":[],"publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W197854957","mag":"197854957"},"language":"en","primary_location":{"id":"mag:197854957","doi":null,"is_oa":false,"landing_page_url":"http://ragibhasan.com/wp-content/uploads/publications/papers/hasan01linear.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W197854957"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5071817725","display_name":"Pradipta Mitra","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pradipta Mitra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076964972","display_name":"Ragib Hasan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ragib Hasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076413241","display_name":"Mohammad Kaykobad","orcid":"https://orcid.org/0000-0003-0485-5041","observed_orcids":["https://orcid.org/0000-0003-0485-5041"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Kaykobad","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0485-5041","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":9.999999747378752e-05,"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/linear-time-algorithms","display_name":"linear-time algorithms","score":0.6779999732971191},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.7210000157356262},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.609000027179718}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8053269386291504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.662182092666626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6106870174407959},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.58026123046875},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5688780546188354},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5503789186477661},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5360093116760254},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4867715835571289},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.48522233963012695},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.46954211592674255},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4650140404701233},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.45885542035102844},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44531092047691345},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4109047055244446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3216899037361145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26244106888771057},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22421851754188538},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:197854957","doi":null,"is_oa":false,"landing_page_url":"http://ragibhasan.com/wp-content/uploads/publications/papers/hasan01linear.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.6357","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ragib.hypermart.net/research/sssp-ragib-02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1984673198","https://openalex.org/W1999545213","https://openalex.org/W2084224084","https://openalex.org/W2126911909","https://openalex.org/W2169528473","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W7099422692","https://openalex.org/W2023126570","https://openalex.org/W7128480316","https://openalex.org/W1568092560","https://openalex.org/W7215129677","https://openalex.org/W7095356367","https://openalex.org/W7130606242","https://openalex.org/W7213287624","https://openalex.org/W2905964455","https://openalex.org/W2095941092"],"abstract_inverted_index":{"The":[0],"shortest":[1,35],"path":[2,36],"problem":[3,37],"is":[4,56,62,69],"one":[5],"of":[6,31,45,50,53,65,72],"the":[7,29,32,43,51,54,63,70],"most":[8],"studied":[9],"problems":[10],"in":[11,38],"computer":[12],"science.":[13],"In":[14,74],"a":[15,59],"previous":[16],"paper":[17],"[7],":[18],"we":[19,77],"suggested":[20],"an":[21,79],"algorithm":[22],"(the":[23],"Augmented":[24],"Shortest":[25],"Path":[26],"Algorithm)":[27],"for":[28],"solution":[30],"single":[33],"source":[34],"O(mk+n)":[39],"time,":[40],"where":[41],"k,":[42],"ratio":[44],"maximum":[46],"and":[47,67],"minimum":[48],"weights":[49],"edges":[52,66],"graph,":[55],"bounded":[57],"by":[58],"constant,":[60],"m":[61],"number":[64,71],"n":[68],"vertices.":[73],"this":[75],"paper,":[76],"propose":[78],"improvement.":[80]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W197854957","counts_by_year":[],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
