{"id":"https://openalex.org/W1972752118","doi":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","title":"Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP","display_name":"Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1972752118","doi":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","mag":"1972752118"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5018333582","display_name":"Bahman Kalantari","orcid":"https://orcid.org/0000-0001-6217-9227"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Kalantari","raw_affiliation_strings":["Department of Computer Science Rutgers University, New Brunswick, New Jersey 08903","Department of Computer Science, Rutgers University, New Brunswick, New Jersey 08903"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Rutgers University, New Brunswick, New Jersey 08903","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick, New Jersey 08903","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072845026","display_name":"G. B. Khosrovshahi","orcid":"https://orcid.org/0000-0001-7716-8459"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]},{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"G. B. Khosrovshahi","raw_affiliation_strings":["Institute for Studies in Theoretical Physics and Mathematics (IPM) and Department of Mathematics, University of Tehran, P.O. Box 19395-1795, Tehran","Institute for Studies in Theoretical Physics and Mathematics (IPM) and Department of Mathematics, University of Tehran, P.O. Box 19395\u20101795, Tehran"],"affiliations":[{"raw_affiliation_string":"Institute for Studies in Theoretical Physics and Mathematics (IPM) and Department of Mathematics, University of Tehran, P.O. Box 19395-1795, Tehran","institution_ids":["https://openalex.org/I23946033","https://openalex.org/I4210146419"]},{"raw_affiliation_string":"Institute for Studies in Theoretical Physics and Mathematics (IPM) and Department of Mathematics, University of Tehran, P.O. Box 19395\u20101795, Tehran","institution_ids":["https://openalex.org/I23946033"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018333582"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.09522453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"28","issue":"4","first_page":"211","last_page":"219"},"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.9894000291824341,"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.9894000291824341,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9878000020980835,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8644741177558899},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6471638679504395},{"id":"https://openalex.org/keywords/magic","display_name":"MAGIC (telescope)","score":0.6332100629806519},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5922258496284485},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.48348766565322876},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48029229044914246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4165778160095215},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph labeling","score":0.41277724504470825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3780701756477356},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07656627893447876},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07522335648536682},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07038316130638123}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8644741177558899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6471638679504395},{"id":"https://openalex.org/C2777704519","wikidata":"https://www.wikidata.org/wiki/Q45732","display_name":"MAGIC (telescope)","level":2,"score":0.6332100629806519},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5922258496284485},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.48348766565322876},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48029229044914246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4165778160095215},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.41277724504470825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3780701756477356},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07656627893447876},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07522335648536682},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07038316130638123},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W635799472","https://openalex.org/W3096088896","https://openalex.org/W4234179797","https://openalex.org/W4205772203","https://openalex.org/W2219491752","https://openalex.org/W2169820283","https://openalex.org/W3176408888","https://openalex.org/W2588867027","https://openalex.org/W3157823048","https://openalex.org/W3212292535"],"abstract_inverted_index":{"Let":[0],"G":[1,60,229],"be":[2,19,35,64,132,161,188,201],"an":[3],"undirected":[4],"graph":[5],"with":[6,37,128,256],"n":[7],"vertices":[8,255],"and":[9,26,41,85,95,124,151,175],"m":[10],"edges.":[11],"A":[12],"natural":[13],"number":[14],"\u03bb":[15],"is":[16,58,61,112],"said":[17,62],"to":[18,63,184],"a":[20,69,116,181,210,238,245],"magic":[21,24,29,71,77,83,240],"labeling,":[22,25,30,78,84],"positive":[23,28,70,76,82],"fractional":[27,81],"if":[31,66],"the":[32,50,53,74,79,86,135,148,226,234,249,254],"edges":[33,57,227],"can":[34,131,160,187,200],"labeled":[36],"nonnegative":[38,231],"integers,":[39],"naturals,":[40],"rationale":[42],"\u22651,":[43],"respectively,":[44,97],"so":[45],"that":[46,100,146,225],"for":[47,126,138,214,248],"each":[48,263],"vertex":[49,88],"sum":[51],"of":[52,55,118,155,212,251,259],"labels":[54],"incident":[56],"\u03bb.":[59],"regularizable":[65,119],"it":[67],"has":[68],"labeling.":[72],"Denoting":[73],"minimum":[75,80],"maximum":[87,152,205],"degree":[89],"by":[90,122],"\u03bb\u02c6":[91,93,101,176,185],"*,":[92,94,177],"\u03b4,":[96],"we":[98,243],"prove":[99],"*":[102,186,219],"\u2264":[103],"min":[104],"{[n/2]\u03b4,":[105],"2m,":[106],"2\u03bb\u02c6":[107,218,221],"*).":[108],"The":[109],"bound":[110],"2m":[111],"also":[113],"derivable":[114],"from":[115],"characterization":[117],"graphs":[120,127,213],"stated":[121],"Pulleyblank,":[123],"regularizability":[125,157],"nonbipartite":[129],"components":[130],"tested":[133,162],"via":[134],"Bourjolly-Pulleyblank":[136],"algorithm":[137,247],"testing":[139],"2-bicriticality":[140],"in":[141,163,190,228],"O(nm)":[142],"time.":[143,194],"We":[144,208],"show":[145],"using":[147,203,237],"above":[149],"bounds":[150],"flow":[153,206],"algorithms":[154],"Ahuja-Orlin-Tarjan":[156],"(or":[158],"2-bicriticality)":[159],"T(n,m)":[164],"=":[165,217,220],"O(min{nm":[166],"+":[167,173],"n2&log":[168],"nsquare;,":[169],"nm":[170],"log((n/m)&log":[171],"nsquare;":[172],"2)}),":[174],"as":[178,180],"well":[179],"2-approximates":[182],"solution":[183],"computed":[189],"O(T(n,":[191],"m)log":[192],"n)":[193],"For":[195],"dense":[196],"graphs,":[197],"T(n,":[198],"m)":[199],"improved":[202],"parallel":[204],"algorithms.":[207],"exhibit":[209],"family":[211],"which":[215],"[n/2]\u03b4":[216],"*.":[222],"Finally,":[223],"given":[224],"have":[230],"weights":[232],"satisfying":[233],"triangle":[235],"inequality,":[236],"capacitated":[239],"labeling":[241],"solution,":[242],"construct":[244],"2-approximate":[246],"problem":[250],"covering":[252,264],"all":[253],"optimal":[257],"set":[258],"disjoint":[260],"even":[261],"cycles,":[262],"at":[265],"least":[266],"four":[267],"vertices.":[268],"\u00a9":[269],"1996":[270],"John":[271],"Wiley":[272],"&":[273],"Sons,":[274],"Inc.":[275]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}