{"id":"https://openalex.org/W1894040992","doi":"https://doi.org/10.25911/5d7a298596b54","title":"Designing Efficient Parallel Algorithms for Graph Problems","display_name":"Designing Efficient Parallel Algorithms for Graph Problems","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1894040992","doi":"https://doi.org/10.25911/5d7a298596b54","mag":"1894040992"},"language":"en","primary_location":{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/47660","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1885/47660","pdf_url":"http://hdl.handle.net/1885/47660","source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis (PhD)"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1885/47660","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077465517","display_name":"Weifa Liang","orcid":"https://orcid.org/0000-0002-8207-6740","observed_orcids":["https://orcid.org/0000-0002-8207-6740"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Liang, Weifa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5077465517"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6592000126838684,"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.6592000126838684,"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.3240000009536743,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.006300000008195639,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/parallel-graph-algorithms","display_name":"parallel graph algorithms","score":0.9049999713897705},{"id":"https://openalex.org/keywords/dynamic-graph-updates","display_name":"dynamic graph updates","score":0.765999972820282},{"id":"https://openalex.org/keywords/graph-sparsification","display_name":"graph sparsification","score":0.878000020980835},{"id":"https://openalex.org/keywords/communication-networks","display_name":"communication networks","score":0.7139999866485596},{"id":"https://openalex.org/keywords/pram-model","display_name":"PRAM model","score":0.8420000076293945},{"id":"https://openalex.org/keywords/mesh-interconnection-networks","display_name":"mesh interconnection networks","score":0.8550000190734863},{"id":"https://openalex.org/keywords/hypercube-networks","display_name":"hypercube networks","score":0.8960000276565552},{"id":"https://openalex.org/keywords/graph-problems","display_name":"graph problems","score":0.3059999942779541}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6943817734718323},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5788236856460571},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5072821974754333},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.49650269746780396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4584692120552063},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45245182514190674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42626190185546875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42257654666900635},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.4215913712978363},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36372944712638855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23113954067230225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20314398407936096},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09511253237724304}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/47660","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1885/47660","pdf_url":"http://hdl.handle.net/1885/47660","source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis (PhD)"},{"id":"mag:1894040992","doi":null,"is_oa":false,"landing_page_url":"https://openresearch-repository.anu.edu.au/bitstream/1885/47660/6/01front.pdf","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},{"id":"doi:10.25911/5d7a298596b54","doi":"https://doi.org/10.25911/5d7a298596b54","is_oa":true,"landing_page_url":"https://doi.org/10.25911/5d7a298596b54","pdf_url":null,"source":{"id":"https://openalex.org/S7407050548","display_name":"The Australian National University","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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Other"}],"best_oa_location":{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/47660","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1885/47660","pdf_url":"http://hdl.handle.net/1885/47660","source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis (PhD)"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1894040992.pdf","grobid_xml":"https://content.openalex.org/works/W1894040992.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2504493224","https://openalex.org/W4230982403","https://openalex.org/W1525859652","https://openalex.org/W2478626498","https://openalex.org/W1545943120","https://openalex.org/W28243696","https://openalex.org/W1558815430","https://openalex.org/W3169630860","https://openalex.org/W2547094638","https://openalex.org/W70164100"],"abstract_inverted_index":{"Graph":[0],"algorithms":[1,63],"are":[2,14,37,95,111],"concerned":[3],"with":[4],"the":[5,76,79,87,93,112,120],"algorithmic":[6],"aspects":[7],"of":[8,23,35,67,75,84,104],"solving":[9],"graph":[10,68],"problems.":[11],"The":[12,102],"problems":[13,69,80,94],"motivated":[15],"from":[16,32],"and":[17,27,50,119,128],"have":[18,45,71],"application":[19,36],"to":[20,98],"diverse":[21],"areas":[22,34],"computer":[24],"science,":[25],"engineering":[26],"other":[28],"disciplines.":[29],"Problems":[30],"arising":[31],"these":[33,57,65],"good":[38],"candidates":[39],"for":[40,64],"parallelization":[41],"since":[42],"they":[43],"often":[44],"both":[46],"intense":[47],"computational":[48],"needs":[49],"stringent":[51],"response":[52],"time":[53],"requirements.":[54],"Motivated":[55],"by":[56],"concerns,":[58],"this":[59],"thesis":[60],"investigates":[61],"parallel":[62,105],"kinds":[66],"that":[70],"at":[72],"least":[73],"one":[74],"following":[77],"properties:":[78],"involve":[81],"some":[82],"type":[83],"dynamic":[85],"updates;":[86],"sparsification":[88],"technique":[89],"is":[90],"applicable;":[91],"or":[92],"closely":[96],"related":[97],"communications":[99],"network":[100,123],"issues.":[101],"models":[103,124],"computation":[106],"used":[107],"in":[108],"our":[109],"studies":[110],"Parallel":[113],"Random":[114],"Access":[115],"Machine":[116],"(PRAM)":[117],"model":[118],"practical":[121],"interconnection":[122],"such":[125],"as":[126],"meshes":[127],"hypercubes.":[129],"\u00b6":[130],"...":[131]},"counts_by_year":[],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}