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

DOI10.1016/J.JDA.2015.01.011zbMATH Open1322.68103OpenAlexW2087645552WikidataQ60692221 ScholiaQ60692221MaRDI QIDQ2018542FDOQ2018542

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

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

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)

Cites Work

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

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

Uses Software

• MiniSat
• BEE

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)