{"id":"https://openalex.org/W1980468504","doi":"https://doi.org/10.1142/s0129054115500021","title":"Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i>","display_name":"Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i>","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1980468504","doi":"https://doi.org/10.1142/s0129054115500021","mag":"1980468504"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054115500021","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054115500021","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5014588132","display_name":"Sanpawat Kantabutra","orcid":"https://orcid.org/0000-0002-1199-2098"},"institutions":[{"id":"https://openalex.org/I48076826","display_name":"Chiang Mai University","ror":"https://ror.org/05m2fqn25","country_code":"TH","type":"education","lineage":["https://openalex.org/I48076826"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Sanpawat Kantabutra","raw_affiliation_strings":["The Theory of Computation Group, Department of Computer Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, 50200, Thailand"],"affiliations":[{"raw_affiliation_string":"The Theory of Computation Group, Department of Computer Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, 50200, Thailand","institution_ids":["https://openalex.org/I48076826"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014588132"],"corresponding_institution_ids":["https://openalex.org/I48076826"],"apc_list":null,"apc_paid":null,"fwci":0.701,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72591275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"26","issue":"01","first_page":"33","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9988999962806702,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9988999962806702,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7788090109825134},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7051534652709961},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6040711998939514},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.4970143139362335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48930880427360535},{"id":"https://openalex.org/keywords/edge-graceful-labeling","display_name":"Edge-graceful labeling","score":0.48842018842697144},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45673561096191406},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43099355697631836},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph labeling","score":0.42608675360679626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3808927536010742},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3390580415725708},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.17353394627571106},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10011187195777893},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07705003023147583}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7788090109825134},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7051534652709961},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6040711998939514},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.4970143139362335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48930880427360535},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.48842018842697144},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45673561096191406},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43099355697631836},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.42608675360679626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3808927536010742},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3390580415725708},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17353394627571106},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10011187195777893},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07705003023147583},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054115500021","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054115500021","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322614","display_name":"Thailand Research Fund","ror":"https://ror.org/03gd1bh37"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W83409048","https://openalex.org/W1835431573","https://openalex.org/W1973518576","https://openalex.org/W2048036606","https://openalex.org/W2130566259","https://openalex.org/W2143462372","https://openalex.org/W2993208429","https://openalex.org/W3138237834","https://openalex.org/W4252800478"],"related_works":["https://openalex.org/W2186458673","https://openalex.org/W115645095","https://openalex.org/W3215888473","https://openalex.org/W3187629674","https://openalex.org/W3119677583","https://openalex.org/W3092866983","https://openalex.org/W29790421","https://openalex.org/W2955778118","https://openalex.org/W2276429555","https://openalex.org/W3212292535"],"abstract_inverted_index":{"Given":[0],"an":[1,131],"undirected,":[2],"connected,":[3],"simple":[4],"graph":[5],"G":[6,43],"=":[7],"(V,E),":[8],"two":[9],"vertex":[10],"labelings":[11],"L":[12,45,254],"V":[13,16,46,49,255,258],"and":[14,22,95,101,183,213,256,270],"L'":[15,48,257],"of":[17,20,31,78,99,141,174,247,273],"the":[18,36,51,59,76,87,97,110,113,139,155,162,166,178,209,223,229,242,245,251,264],"vertices":[19,79],"G,":[21],"a":[23,29,172,268,271],"label":[24],"flip":[25,52],"operation":[26],"that":[27,138],"interchanges":[28],"pair":[30],"labels":[32],"on":[33,63,91,115,130],"adjacent":[34],"vertices,":[35],"Vertex":[37,60,88],"Relabeling":[38,61,89],"Problem":[39,62,90],"is":[40,75,164,211,225],"to":[41,147,195,250],"transform":[42],"from":[44],"into":[47],"using":[50,127],"operation.":[53],"Agnarsson":[54,232],"et":[55,233],"al.":[56,234],"showed":[57],"solving":[58],"arbitrary":[64],"graphs":[65,92,116,192],"can":[66,119,143,201,214,259],"be":[67,120,144,202,215,260],"done":[68],"in":[69,80,123,151,205,217,231,244],"\u03b8(n":[70],"2":[71],"),":[72],"where":[73],"n":[74],"number":[77,140],"G.":[81],"In":[82,263],"this":[83,152,199,236],"article":[84],"we":[85,108,135,240,266],"study":[86],"K":[93,117,196],"m,m":[94,118,197],"introduce":[96],"concept":[98],"parity":[100,111],"precise":[102,248],"labelings.":[103],"We":[104,187],"show":[105,137,189],"that,":[106,190],"when":[107,191,208,222,253],"consider":[109],"labeling,":[112],"problem":[114,200],"solved":[121,203,216],"quickly":[122],"O(log":[124],"m)":[125,220],"time":[126,156,168,207,221],"m":[128,176,182],"processors":[129,142],"EREW":[132],"PRAM.":[133],"Additionally,":[134],"also":[136,188],"further":[145],"reduced":[146],"[Formula:":[148,184],"see":[149,185],"text]":[150],"case":[153,246],"while":[154,177],"complexity":[157,169],"does":[158],"not":[159],"change.":[160],"When":[161],"labeling":[163,210,224,249],"precise,":[165,226],"parallel":[167],"increases":[170],"by":[171],"factor":[173],"log":[175,219],"processor":[179],"complexities":[180],"remain":[181],"text].":[186],"are":[193],"restricted":[194],",":[198],"optimally":[204],"O(m)":[206],"parity,":[212],"O(m":[218],"thereby":[227],"improving":[228],"result":[230,243],"for":[235],"specific":[237],"case.":[238],"Moreover,":[239],"generalize":[241],"cases":[252],"any":[261],"configuration.":[262],"end":[265],"give":[267],"conclusion":[269],"list":[272],"some":[274],"interesting":[275],"open":[276],"problems.":[277]},"counts_by_year":[{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}