SAT and IP based algorithms for magic labeling with applications

DOI10.1007/978-3-642-45278-9_22MaRDI QIDQ2870032zbMATH OpenOpenAlexFDO

Authors Gerold Jäger

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_22

zbMATH Keywords

Boolean satisfiabilityinteger programmingmagic labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
• Magic labelings of graphs
• scientific article; zbMATH DE number 840691
• An application of mathematical programming in vertex-magic total labeling problems
• scientific article; zbMATH DE number 5178701

Cited in

(6)

• SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
• Fuzzy magic labeling of simple graphs
• Magic labelings of graphs
• An application of mathematical programming in vertex-magic total labeling problems
• Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
• Parallel Processing and Applied Mathematics

This page was built for publication: SAT and IP based algorithms for magic labeling with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870032)