{"id":"https://openalex.org/W2085201606","doi":"https://doi.org/10.1007/bf01940880","title":"Algorithms for dense graphs and networks on the random access computer","display_name":"Algorithms for dense graphs and networks on the random access computer","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2085201606","doi":"https://doi.org/10.1007/bf01940880","mag":"2085201606"},"language":"en","primary_location":{"id":"doi:10.1007/bf01940880","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01940880","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J. Cheriyan","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada","DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO CANADA N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO CANADA N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"K. Mehlhorn","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik and Universit\u00e4t des Saarlandes, D-66123, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik and Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany D-66123#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik and Universit\u00e4t des Saarlandes, D-66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik and Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany D-66123#TAB#","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046805470"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0301,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.77512311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"6","first_page":"521","last_page":"549"},"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.9998000264167786,"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.9998000264167786,"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.9976000189781189,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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/combinatorics","display_name":"Combinatorics","score":0.7753065824508667},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6271986961364746},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5995128154754639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5567511916160583},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5365005135536194},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5315349698066711},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5205779671669006},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4835081398487091},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.43711334466934204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4199259877204895},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.41724157333374023},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3629416823387146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31546592712402344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.255666047334671}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7753065824508667},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6271986961364746},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5995128154754639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5567511916160583},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5365005135536194},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5315349698066711},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5205779671669006},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4835081398487091},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.43711334466934204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4199259877204895},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.41724157333374023},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3629416823387146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31546592712402344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.255666047334671},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01940880","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01940880","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W835219510","https://openalex.org/W1541277988","https://openalex.org/W1544789779","https://openalex.org/W1570068679","https://openalex.org/W1759083992","https://openalex.org/W1969357318","https://openalex.org/W1985361644","https://openalex.org/W2017139167","https://openalex.org/W2057869046","https://openalex.org/W2061496873","https://openalex.org/W2070099460","https://openalex.org/W2075322358","https://openalex.org/W2075410688","https://openalex.org/W2078960854","https://openalex.org/W2087223060","https://openalex.org/W2090010485","https://openalex.org/W2098755772","https://openalex.org/W2118382442","https://openalex.org/W2156153879","https://openalex.org/W2157529519","https://openalex.org/W2169528473","https://openalex.org/W2338905098","https://openalex.org/W2752885492","https://openalex.org/W6632877052","https://openalex.org/W6703734804","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W2121104987","https://openalex.org/W423069184","https://openalex.org/W4293584096","https://openalex.org/W2081163699","https://openalex.org/W2082494488","https://openalex.org/W2054349495","https://openalex.org/W2998116189"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}