{"id":"https://openalex.org/W6945115930","doi":"https://doi.org/10.2312/egpgv/egpgv08/025-032","title":"A Scalable Parallel Force-Directed Graph Layout Algorithm","display_name":"A Scalable Parallel Force-Directed Graph Layout Algorithm","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W6945115930","doi":"https://doi.org/10.2312/egpgv/egpgv08/025-032"},"language":"en","primary_location":{"id":"doi:10.2312/egpgv/egpgv08/025-032","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/025-032","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egpgv/egpgv08/025-032","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tikhonova, Anna","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tikhonova, Anna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ma, Kwan-Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Kwan-Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11354","display_name":"Evolution and Paleontology Studies","score":0.517300009727478,"subfield":{"id":"https://openalex.org/subfields/1911","display_name":"Paleontology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11354","display_name":"Evolution and Paleontology Studies","score":0.517300009727478,"subfield":{"id":"https://openalex.org/subfields/1911","display_name":"Paleontology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10421","display_name":"Pleistocene-Era Hominins and Archaeology","score":0.09570000320672989,"subfield":{"id":"https://openalex.org/subfields/3314","display_name":"Anthropology"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10955","display_name":"Paleontology and Evolutionary Biology","score":0.08020000159740448,"subfield":{"id":"https://openalex.org/subfields/1911","display_name":"Paleontology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.745199978351593},{"id":"https://openalex.org/keywords/graph-layout","display_name":"Graph Layout","score":0.6509000062942505},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5806000232696533},{"id":"https://openalex.org/keywords/graph-drawing","display_name":"Graph drawing","score":0.5309000015258789},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5271999835968018},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3959999978542328},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.37400001287460327},{"id":"https://openalex.org/keywords/wait-for-graph","display_name":"Wait-for graph","score":0.3571999967098236}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8061000108718872},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.745199978351593},{"id":"https://openalex.org/C2911174283","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph Layout","level":4,"score":0.6509000062942505},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5806000232696533},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.5309000015258789},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5271999835968018},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47940000891685486},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.37400001287460327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36480000615119934},{"id":"https://openalex.org/C106891557","wikidata":"https://www.wikidata.org/wiki/Q4148051","display_name":"Wait-for graph","level":4,"score":0.3571999967098236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33559998869895935},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.295199990272522},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.26759999990463257},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/egpgv/egpgv08/025-032","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/025-032","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.2312/egpgv/egpgv08/025-032","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/025-032","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Understanding":[0],"the":[1,53,89,102,111,118,124,130,143,147,153,156,160],"structure,":[2],"dynamics,":[3],"and":[4,40,60,97,116,139,141,155],"evolution":[5],"of":[6,16,38,52,110,120,133,146,152,162],"large":[7,73],"graphs":[8,42],"is":[9,28,63],"becoming":[10],"increasingly":[11],"important":[12,69],"in":[13,25,105],"a":[14,64,81,108,114],"variety":[15],"fields.":[17],"The":[18,50],"demand":[19],"for":[20,67,159],"visual":[21,144],"tools":[22],"to":[23,46],"aid":[24],"this":[26,77],"process":[27],"rising":[29],"accordingly.":[30],"Yet,":[31],"many":[32],"algorithms":[33,158],"that":[34],"create":[35],"good":[36],"representations":[37],"small":[39],"medium-sized":[41],"do":[43],"not":[44],"scale":[45],"larger":[47],"graph":[48,74,84,112],"sizes.":[49],"exploitation":[51],"massive":[54],"computational":[55],"power":[56],"provided":[57],"by":[58,100],"parallel":[59,83],"distributed":[61],"computing":[62],"natural":[65],"progression":[66],"handling":[68],"problems":[70],"such":[71],"as":[72,123],"layout.":[75],"In":[76],"paper,":[78],"we":[79],"present":[80],"scalable":[82],"layout":[85,103,125,161],"algorithm":[86,93],"based":[87],"on":[88],"force-directed":[90],"model.":[91],"Our":[92],"requires":[94],"minimal":[95],"pre-processing":[96],"achieves":[98],"scalability":[99],"conducting":[101],"computation":[104,126],"stages":[106],"-":[107],"portion":[109],"at":[113],"time,":[115],"decreasing":[117],"amount":[119],"inter-processor":[121],"communication":[122],"progresses.":[127],"We":[128],"provide":[129],"implementation":[131],"details":[132],"our":[134],"algorithm,":[135],"evaluate":[136],"its":[137],"performance":[138],"scalability,":[140],"compare":[142],"quality":[145],"resulting":[148],"drawings":[149],"against":[150],"some":[151],"classic":[154],"fastest":[157],"general":[163],"graphs.":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}