2-limited-broadcast-domination-grid-graph-prove-lower-bounds

https://github.com/fastbodin/2-limited-broadcast-domination-grid-graph-prove-lower-bounds

Science Score: 57.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
    Found CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
    Found 2 DOI reference(s) in README
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (8.1%) to scientific vocabulary
Last synced: 6 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: fastbodin
  • Language: C++
  • Default Branch: main
  • Size: 28.3 KB
Statistics
  • Stars: 1
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created over 3 years ago · Last pushed about 2 years ago
Metadata Files
Readme Citation

README.md

2-limited-broadcast-domination-grid-graph-prove-lower-bounds

This is a method for proving lower bounds for the 2-limited broadcast domination number on the Cartesian product of two paths, a path and a cycle, and two cycles. This method requires a local copy of a gurobi solver (https://www.gurobi.com/). The file gurobi.env contains some gurobi settings. The file provelowerbounds.cpp implements the work described in https://doi.org/10.46298/dmtcs.11478 in C++.

Compile:

To compile with gurobi, run the following command (assuming you have a mac and used the default directory for gurobi)

g++ -m64 -g -O3 provelowerbounds.cpp -I/Library/gurobi1000/macosuniversal2/include -L/Library/gurobi1000/macosuniversal2/lib -lgurobi_c++ -lgurobi100 -lm

Note: Make sure to change to the appropriate version of gurobi that you are running, i.e. change "gurobi1000" and "-lgurobi100" as necessary

Run:

The compiled a.out will run the instance of the problem defined in lines 6 through 25 of provelowerbounds.cpp.

PDFs: If you want to view a PDF of the results, set PROD_FIG on line 20 to 1 and 0 otherwise. Additionally, run a.out >> output.py. This will output a python file which, when run with

python output.py

will produce the desired PDF by using the function in graphic.py.

Owner

  • Login: fastbodin
  • Kind: user

Citation (CITATION.cff)

cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
  - family-names: Slobodin
    given-names: A.
title: "C++ implementation of a method for proving lower bounds for the 2-limited broadcast domination number on grid graphs"
version: 1.0
date-released: 2022-07-29
repository-code: "https://github.com/fastbodin/2-limited-broadcast-domination-grid-graph-prove-lower-bounds"

GitHub Events

Total
Last Year