{"id":"https://openalex.org/W129381002","doi":null,"title":"Algorithms in Java, Part 5: Graph Algorithms","display_name":"Algorithms in Java, Part 5: Graph Algorithms","publication_year":2003,"publication_date":"2003-07-25","ids":{"openalex":"https://openalex.org/W129381002","mag":"129381002"},"language":"en","primary_location":{"id":"mag:129381002","doi":null,"is_oa":false,"landing_page_url":"https://www.amazon.com/Algorithms-Java-Part-Graph-Pt-5/dp/0201361213","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},"volume":null,"type":"book","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/A5077370067","display_name":"Robert Sedgewick","orcid":"https://orcid.org/0009-0001-7238-7860","observed_orcids":["https://orcid.org/0009-0001-7238-7860"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Sedgewick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010117082","display_name":"Michael Schidlowsky","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Schidlowsky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4063,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.74806202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.7842000126838684,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.7842000126838684,"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.19789999723434448,"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":0.01269999984651804,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":1.0},{"id":"https://openalex.org/keywords/java-implementation","display_name":"Java implementation","score":0.8349999785423279},{"id":"https://openalex.org/keywords/network-connectivity","display_name":"network connectivity","score":0.8629999756813049},{"id":"https://openalex.org/keywords/circuit-design","display_name":"circuit design","score":0.9610000252723694},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.984000027179718},{"id":"https://openalex.org/keywords/transaction-processing","display_name":"transaction processing","score":0.968999981880188},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.9980000257492065},{"id":"https://openalex.org/keywords/abstract-data-types","display_name":"abstract data types","score":0.9020000100135803},{"id":"https://openalex.org/keywords/object-oriented-programming","display_name":"object-oriented programming","score":0.8840000033378601}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.788877010345459},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.7366877794265747},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.6476689577102661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5537979602813721},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.48401257395744324},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4391208291053772},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43831557035446167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4127146005630493},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3976825475692749},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.28889086842536926}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:129381002","doi":null,"is_oa":false,"landing_page_url":"https://www.amazon.com/Algorithms-Java-Part-Graph-Pt-5/dp/0201361213","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}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W70368499","https://openalex.org/W1488397247","https://openalex.org/W199439828","https://openalex.org/W7098511288","https://openalex.org/W2130173265","https://openalex.org/W2748591920","https://openalex.org/W2948389233","https://openalex.org/W7045415391","https://openalex.org/W316974799","https://openalex.org/W2936795142"],"abstract_inverted_index":{"From":[0],"the":[1,50,82,107,180,188],"Publisher:\r\nOnce":[2],"again,":[3],"Robert":[4],"Sedgewick":[5,48,72],"provides":[6],"a":[7,28,85,140,159],"current":[8],"and":[9,42,56,71,87,90,114,128,139,152,156,158,173,185],"comprehensive":[10],"introduction":[11],"to":[12],"important":[13],"algorithms.":[14,144],"The":[15,117,167],"focus":[16,135],"this":[17,46],"time":[18],"is":[19,106],"on":[20,136],"graph":[21],"algorithms,":[22,124],"which":[23],"are":[24],"increasingly":[25],"critical":[26],"for":[27,66,164,187],"wide":[29],"range":[30,141],"of":[31,54,142,161],"applications,":[32],"such":[33],"as":[34],"network":[35],"connectivity,":[36],"circuit":[37],"design,":[38],"scheduling,":[39],"transaction":[40],"processing,":[41],"resource":[43],"allocation.":[44],"In":[45],"book,":[47,119],"offers":[49],"same":[51],"successful":[52],"blend":[53],"theory":[55],"practice":[57],"that":[58,79],"has":[59],"made":[60],"his":[61],"work":[62],"popular":[63],"with":[64],"programmers":[65],"many":[67],"years.":[68],"Michael":[69],"Schidlowsky":[70],"have":[73],"developed":[74],"concise":[75],"new":[76,150,162],"Java":[77,171],"implementations":[78,178],"both":[80],"express":[81],"methods":[83],"in":[84,95,98,110],"natural":[86,168],"direct":[88],"manner":[89],"also":[91],"can":[92],"be":[93],"used":[94],"real":[96],"applications.\r\n\r\nAlgorithms":[97],"Java,":[99],"Third":[100],"Edition,":[101],"Part":[102],"5:":[103],"Graph":[104],"Algorithms":[105],"second":[108],"book":[109,133],"Sedgewick's":[111],"thoroughly":[112],"revised":[113],"rewritten":[115],"series.":[116],"first":[118],"Parts":[120],"1-4,":[121],"addresses":[122],"fundamental":[123],"data":[125,175],"structures,":[126],"sorting,":[127],"searching.":[129],"A":[130],"forthcoming":[131],"third":[132],"will":[134],"strings,":[137],"geometry,":[138],"advanced":[143],"Each":[145],"book's":[146],"expanded":[147],"coverage":[148],"features":[149],"algorithms":[151],"implementations,":[153],"enhanced":[154],"descriptions":[155],"diagrams,":[157],"wealth":[160],"exercises":[163],"polishing":[165],"skills.":[166],"match":[169],"between":[170],"classes":[172],"abstract":[174],"type":[176],"(ADT)":[177],"makes":[179],"code":[181],"more":[182],"broadly":[183],"useful":[184],"relevant":[186],"modern":[189],"object-oriented":[190],"programming":[191],"environment.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}