{"id":"https://openalex.org/W564448149","doi":null,"title":"Algorithms in Java","display_name":"Algorithms in Java","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W564448149","mag":"564448149"},"language":"en","primary_location":{"id":"mag:564448149","doi":null,"is_oa":false,"landing_page_url":"https://ci.nii.ac.jp/ncid/BA58608111","pdf_url":null,"source":{"id":"https://openalex.org/S4306462774","display_name":"Addison-Wesley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Addison-Wesley eBooks","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":true,"raw_author_name":"Robert Sedgewick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5077370067"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3386,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.73255814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9833999872207642,"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":0.9833999872207642,"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.01510000042617321,"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.0007999999797903001,"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":0.9990000128746033},{"id":"https://openalex.org/keywords/graph-data-structures","display_name":"graph data structures","score":0.6740000247955322},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":0.7829999923706055},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"breadth-first search","score":1.0},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8339999914169312},{"id":"https://openalex.org/keywords/dags","display_name":"DAGs","score":0.7120000123977661},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"topological sorting","score":0.9319999814033508},{"id":"https://openalex.org/keywords/strongly-connected-components","display_name":"strongly connected components","score":0.6759999990463257},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"transitive closure","score":0.8230000138282776},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8820000290870667},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7860000133514404},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.8320000171661377},{"id":"https://openalex.org/keywords/network-simplex-algorithm","display_name":"network simplex algorithm","score":0.7089999914169312},{"id":"https://openalex.org/keywords/graph-generators","display_name":"graph generators","score":0.44999998807907104},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5249457359313965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5097820162773132},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.4501892030239105},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4366147816181183},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.43592849373817444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4274296164512634},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4115551710128784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3805727958679199},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3754144012928009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.372051477432251},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36798620223999023},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3663557171821594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35753270983695984},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3377174139022827},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29557669162750244}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:564448149","doi":null,"is_oa":false,"landing_page_url":"https://ci.nii.ac.jp/ncid/BA58608111","pdf_url":null,"source":{"id":"https://openalex.org/S4306462774","display_name":"Addison-Wesley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Addison-Wesley eBooks","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/W3012349412","https://openalex.org/W4255497863","https://openalex.org/W4237133401","https://openalex.org/W70368499","https://openalex.org/W2494652507","https://openalex.org/W3007855918","https://openalex.org/W7140188574","https://openalex.org/W626517032","https://openalex.org/W4255541532","https://openalex.org/W2041303104"],"abstract_inverted_index":{"PART":[0],"V.":[1],"GRAPH":[2],"ALGORITHMS.":[3],"17.":[4],"Graph":[5,10,20,30,52,56],"Properties":[6,40],"and":[7,18,24,47,60,63,74,79,108,116],"Types.":[8],"Glossary.":[9],"ADT.":[11],"Adjacency-Matrix":[12],"Representation.":[13,15],"Adjacency-Lists":[14],"Variations,":[16],"Extensions,":[17],"Costs.":[19],"Generators.":[21],"Simple,":[22],"Euler,":[23],"Hamilton":[25],"Paths.":[26,122,129],"Graph-Processing":[27],"Problems.":[28],"18.":[29],"Search.":[31,36,50,53,110],"Exploring":[32],"a":[33],"Maze.":[34],"Depth-First":[35],"Graph-Search":[37],"ADT":[38],"Functions.":[39],"of":[41,55,65,69,103],"DFS":[42,44,70],"Forests.":[43],"Algorithms.":[45,57,105,148,151],"Separability":[46],"Biconnectivity.":[48],"Breadth-First":[49],"Generalized":[51],"Analysis":[54],"19.":[58],"Digraphs":[59],"DAGs.":[61,82,87],"Glossary":[62],"Rules":[64],"the":[66],"Game.":[67],"Anatomy":[68],"in":[71,86,90,132],"Digraphs.":[72,91],"Reachability":[73,85],"Transitive":[75,92],"Closure.":[76],"Equivalence":[77],"Relations":[78],"Partial":[80],"Orders.":[81],"Topological":[83],"Sorting.":[84],"Strong":[88],"Components":[89],"Closure":[93],"Revisited.":[94],"Perspective.":[95,140,161],"20.":[96],"Minimum":[97],"Spanning":[98],"Trees.":[99],"Representations.":[100],"Underlying":[101,123],"Principles":[102],"MST":[104],"Prim's":[106],"Algorithm":[107],"Priority-First":[109],"Kruskal's":[111],"Algorithm.":[112,114,126,158],"Boruvka's":[113],"Comparisons":[115],"Improvements.":[117],"Euclidean":[118,135],"MST.":[119],"21.":[120],"Shortest":[121,128,130],"Principles.":[124],"Dijkstra's":[125],"All-Pairs":[127],"Paths":[131],"Acyclic":[133],"Networks.":[134,136,145],"Reduction.":[137],"Negative":[138],"Weights.":[139],"22.":[141],"Network":[142,156],"Flow.":[143],"Flow":[144],"Augmenting-Path":[146],"Maxflow":[147,150,152],"Preflow-Push":[149],"Reductions.":[153,160],"Mincost":[154],"Flows.":[155],"Simplex":[157],"Mincost-Flow":[159],"References":[162],"for":[163],"Part":[164],"Five.":[165],"Index.":[166]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}