scientific article; zbMATH DE number 7350751

zbMATH Open1464.05157MaRDI QIDQ4989372FDOQ4989372

Authors: Paul Tabatabai, Dieter P. Gruber 

Publication date: 25 May 2021

Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL24/Tabatabai/taba4.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Title of this publication is not available (Why is that?)

Recommendations

• Liar's domination in graphs
• Liar's domination in graphs
• Truth-teller and liar puzzles and their graphs
• On the total liar's domination of graphs
• Knight's moves, graphs, and lattices
• Liar's domination in Sierpinski-like graphs
• Liar's dominating sets in graphs
• Liar's domination in graphs: complexity and algorithm
• Liar's domination in graphs under some operations
• Liar's domination in unit disk graphs

zbMATH Keywords

gridcomputational complexitymaximizationpartitioninteger programmingcellular automataNP-completenesscoloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Recreational mathematics (00A08)

Cites Work

• Reducibility among combinatorial problems
• Planar 3DM is NP-complete
• Clustering to minimize the maximum intercluster distance
• Title not available (Why is that?)
• Maximum density stable patterns in variants of Conway's game of Life
• Title not available (Why is that?)
• Integer Programming and Conway's Game of Life
• A complete solution to the maximum density still life problem

Cited In (3)

• Knights, spies, games and ballot sequences
• A Lozenge triangulation of the plane with integers
• knights-and-liars

Uses Software

• Gurobi
• COIN-OR
• OEIS
• GitHub

This page was built for publication:

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