Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199612)28:4<211::AID-NET5>3.0.CO;2-O" /><211::AID-NET5>3.0.CO;2-O 10.1002/(SICI)1097-0037(199612)28:4<211::AID-NET5>3.0.CO;2-OzbMath0873.90103OpenAlexW1972752118MaRDI QIDQ4344457

Bahman Kalantari, Gholamreza Khosrovshahi

Publication date: 30 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199612)28:4<211::aid-net5>3.0.co;2-o

zbMATH Keywords

undirected graphmagic labelingparallel maximum flow algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

SAT and IP based algorithms for magic labeling including a complete search for total magic labelings

This page was built for publication: Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP