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

DOI10.1016/J.JDA.2015.01.011MaRDI QIDQ2018542zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• SAT and IP based algorithms for magic labeling with applications
• Totally magic graphs
• scientific article; zbMATH DE number 1760750
• scientific article; zbMATH DE number 1556747
• Magic Labelings on Cycles and Wheels

Cites work

• scientific article; zbMATH DE number 1614340 (Why is no real title available?)
• scientific article; zbMATH DE number 1760750 (Why is no real title available?)
• scientific article; zbMATH DE number 1874444 (Why is no real title available?)
• scientific article; zbMATH DE number 1903357 (Why is no real title available?)
• scientific article; zbMATH DE number 840691 (Why is no real title available?)
• A dynamic survey of graph labeling
• An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem
• Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
• Boosting haplotype inference with local search
• Compiling finite domain constraints to SAT with BEE
• Handbook of knowledge representation.
• Linear programming. Foundations and extensions.
• Magic Labelings on Cycles and Wheels
• Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
• Numbered complete graphs, unusual rulers, and assorted applications
• On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs
• SAT and IP based algorithms for magic labeling with applications
• SAT problems with chains of dependent variables
• Simplifying pseudo-Boolean constraints in residual number systems
• Theory and Applications of Satisfiability Testing
• Tools and Algorithms for the Construction and Analysis of Systems
• Totally magic graphs

Cited in

(5)

• Magic labelings of graphs
• SAT and IP based algorithms for magic labeling with applications
• An application of mathematical programming in vertex-magic total labeling problems
• Parallel Processing and Applied Mathematics
• Magic Labelings on Cycles and Wheels

Describes a project that uses

Uses Software

• BEE
• MiniSat

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

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