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

DOI10.1016/j.jda.2015.01.011zbMath1322.68103OpenAlexW2087645552WikidataQ60692221 ScholiaQ60692221MaRDI QIDQ2018542

Gerold Jäger, Florian Arnold

Publication date: 24 March 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2015.01.011

zbMATH Keywords

integer programmingBoolean satisfiabilitymagic labeling

Mathematics Subject Classification ID

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

Uses Software

• MiniSat
• BEE

Cites Work

• Boosting haplotype inference with local search
• On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs
• A dynamic survey of graph labeling
• SAT problems with chains of dependent variables
• Totally magic graphs
• Linear programming. Foundations and extensions.
• SAT and IP Based Algorithms for Magic Labeling with Applications
• An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
• Simplifying Pseudo-Boolean Constraints in Residual Number Systems
• Numbered complete graphs, unusual rulers, and assorted applications
• Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
• Compiling finite domain constraints to SAT withBEE
• Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
• Theory and Applications of Satisfiability Testing
• Magic Labelings on Cycles and Wheels
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SAT and IP based algorithms for magic labeling including a complete search for total magic labelings