{"id":"https://openalex.org/W1489169316","doi":"https://doi.org/10.1109/cybconf.2015.7175951","title":"Solving nearest neighbors problem on GPU to speed up the Fruchterman-Reingold graph layout algorithm","display_name":"Solving nearest neighbors problem on GPU to speed up the Fruchterman-Reingold graph layout algorithm","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1489169316","doi":"https://doi.org/10.1109/cybconf.2015.7175951","mag":"1489169316"},"language":"en","primary_location":{"id":"doi:10.1109/cybconf.2015.7175951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cybconf.2015.7175951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)","raw_type":"proceedings-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/A5058105327","display_name":"Vojt\u011bch Uher","orcid":"https://orcid.org/0000-0002-7475-3625"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vojtech Uher","raw_affiliation_strings":["Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","Department of Computer Science, V\u0161B-Technical University of Ostrava, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science, V\u0161B-Technical University of Ostrava, Czech Republic#TAB#","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056523918","display_name":"Petr Gajdo\u0161","orcid":"https://orcid.org/0000-0003-1831-3489"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Gajdos","raw_affiliation_strings":["Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","Department of Computer Science and National Supercomputing Center, V\u0160B-Technical University of Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science and National Supercomputing Center, V\u0160B-Technical University of Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033258025","display_name":"Tom\u00e1\u0161 Je\u017eowicz","orcid":"https://orcid.org/0000-0002-8097-8652"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Tomas Jezowicz","raw_affiliation_strings":["Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","Department of Computer Science and National Supercomputing Center, V\u0160B-Technical University of Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, V\u0160 B- Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science and National Supercomputing Center, V\u0160B-Technical University of Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4498,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81212261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.7912259101867676},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5979089736938477},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.59266197681427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5806999206542969},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5259138345718384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48431602120399475},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27120476961135864},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12653228640556335}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7912259101867676},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5979089736938477},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.59266197681427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5806999206542969},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5259138345718384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48431602120399475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27120476961135864},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12653228640556335}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cybconf.2015.7175951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cybconf.2015.7175951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W974746883","https://openalex.org/W1602982241","https://openalex.org/W1970805642","https://openalex.org/W1983502896","https://openalex.org/W1996833743","https://openalex.org/W2006543911","https://openalex.org/W2012464174","https://openalex.org/W2018729969","https://openalex.org/W2069896270","https://openalex.org/W2113841249","https://openalex.org/W2154852471","https://openalex.org/W2161854574","https://openalex.org/W2167482691","https://openalex.org/W6676674358"],"related_works":["https://openalex.org/W2317245370","https://openalex.org/W4249323025","https://openalex.org/W198851386","https://openalex.org/W1980160788","https://openalex.org/W2030310580","https://openalex.org/W947442053","https://openalex.org/W2148915962","https://openalex.org/W2283866686","https://openalex.org/W27867058","https://openalex.org/W2948365806"],"abstract_inverted_index":{"Fast":[0],"searching":[1],"of":[2,57,72,98,112],"the":[3,73,113],"nearest":[4],"neigbors":[5],"in":[6,28,34],"unordered":[7],"point":[8],"clouds":[9],"is":[10,62,79],"a":[11,18,64,69,86,95],"very":[12],"common":[13],"task.":[14],"This":[15,66],"article":[16],"presents":[17],"new":[19,87,96],"parallel":[20,83],"method":[21],"tested":[22],"on":[23,91,102],"graph":[24,75],"layout":[25,76],"algorithm.":[26,114],"Graphs":[27],"computer":[29,38],"science":[30],"are":[31],"widely":[32],"used":[33],"social":[35],"network":[36],"analysis,":[37],"networks,":[39,41],"transportation":[40],"and":[42,94,109],"many":[43],"other":[44],"areas.":[45],"In":[46],"general,":[47],"they":[48],"can":[49],"visualize":[50],"relationships":[51],"between":[52],"objects.":[53],"However,":[54],"fast":[55],"drawing":[56],"graphs":[58],"with":[59],"readable":[60],"layouts":[61],"still":[63],"challenge.":[65],"paper":[67,105],"describes":[68],"novel":[70],"variant":[71],"Fruchterman-Reingold":[74],"algorithm":[77],"which":[78],"adapted":[80],"to":[81],"GPU":[82],"architecture":[84],"using":[85],"K-NN":[88],"approach":[89],"based":[90],"space-filling":[92],"curves":[93],"way":[97],"repulsive":[99],"forces":[100],"computation":[101],"GPU.":[103],"The":[104],"contains":[106],"both":[107],"performance":[108],"quality":[110],"tests":[111]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}