{"id":"https://openalex.org/W7083823904","doi":"https://doi.org/10.48550/arxiv.2509.23706","title":"Parallel Algorithms for the One Sided Crossing Minimization Problem","display_name":"Parallel Algorithms for the One Sided Crossing Minimization Problem","publication_year":2025,"publication_date":"2025-09-28","ids":{"openalex":"https://openalex.org/W7083823904","doi":"https://doi.org/10.48550/arxiv.2509.23706"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2509.23706","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.23706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2509.23706","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Popa, Bogdan-Ioan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Popa, Bogdan-Ioan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Dumitran, Adrian-Marius","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dumitran, Adrian-Marius","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Magureanu, Livia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Magureanu, Livia","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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/T12874","display_name":"Digital Imaging for Blood Diseases","score":0.9469000101089478,"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"}},"topics":[{"id":"https://openalex.org/T12874","display_name":"Digital Imaging for Blood Diseases","score":0.9469000101089478,"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/T10862","display_name":"AI in cancer detection","score":0.007000000216066837,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/speedup","display_name":"Speedup","score":0.9350000023841858},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.569599986076355},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5651000142097473},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5629000067710876},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.388700008392334},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.3817000091075897},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.37689998745918274},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3578000068664551}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9350000023841858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7049999833106995},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.569599986076355},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5651000142097473},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5629000067710876},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5450999736785889},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5088000297546387},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.388700008392334},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.3294999897480011},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3059000074863434},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26440000534057617}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2509.23706","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.23706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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.48550/arxiv.2509.23706","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.23706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":{"The":[0],"One":[1],"Sided":[2],"Crossing":[3],"Minimization":[4],"(OSCM)":[5],"problem":[6,10],"is":[7,164],"an":[8],"optimization":[9],"in":[11,23,31,114,124],"graph":[12,25],"drawing":[13],"that":[14,127],"aims":[15],"to":[16,84,133],"minimize":[17],"the":[18,49,58,63,159],"number":[19],"of":[20,51,60,65,91,146],"edge":[21,46],"crossings":[22,47],"bipartite":[24],"layouts.":[26],"It":[27],"has":[28],"practical":[29],"applications":[30],"areas":[32],"such":[33],"as":[34],"network":[35],"visualization":[36],"and":[37,54,67,93,105,111,117,157],"VLSI":[38],"(Very":[39],"Large":[40],"Scale":[41],"Integration)":[42],"design,":[43],"where":[44],"reducing":[45],"improves":[48],"arrangement":[50],"circuit":[52],"components":[53],"their":[55],"interconnections.":[56],"Despite":[57],"rise":[59],"multi-core":[61],"systems,":[62],"parallelization":[64],"exact":[66,104],"fixed-parameter":[68],"tractable":[69],"(FPT)":[70],"algorithms":[71,107,129],"for":[72,82,108],"OSCM":[73],"remains":[74],"largely":[75],"unexplored.":[76],"Parallel":[77],"variants":[78],"offer":[79],"significant":[80],"potential":[81],"scaling":[83],"larger":[85],"graphs":[86],"but":[87],"require":[88],"careful":[89],"handling":[90],"synchronization":[92],"memory":[94],"management.":[95],"In":[96,138],"this":[97],"paper,":[98],"we":[99],"explore":[100],"various":[101],"previously":[102],"studied":[103],"FPT":[106],"OSCM,":[109],"implementing":[110],"analyzing":[112],"them":[113],"both":[115],"sequential":[116],"parallel":[118],"forms.":[119],"Our":[120],"main":[121],"contribution":[122],"lies":[123],"empirically":[125],"proving":[126],"these":[128],"can":[130],"achieve":[131],"close":[132],"linear":[134,162],"speedup":[135,145,163],"under":[136],"parallelization.":[137],"particular,":[139],"our":[140],"best":[141],"result":[142],"achieves":[143],"a":[144,150],"nearly":[147],"19":[148],"on":[149],"16-core,":[151],"32-thread":[152],"machine.":[153],"We":[154],"further":[155],"investigate":[156],"discuss":[158],"reasons":[160],"why":[161],"not":[165],"always":[166],"attained.":[167]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}