Finding Near-Optimal Weight Independent Sets at Scale

Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash

Open source

DOI
10.7155/jgaa.v28i1.2997
Published
2024-11-15
Container
Journal of Graph Algorithms and Applications
Publisher
Journal of Graph Algorithms and Applications
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.7155/jgaa.v28i1.2997,
  title = {Finding Near-Optimal Weight Independent Sets at Scale},
  author = {Ernestine Großmann and Sebastian Lamm and Christian Schulz and Darren Strash},
  year = {2024},
  journal = {Journal of Graph Algorithms and Applications},
  doi = {10.7155/jgaa.v28i1.2997},
  url = {https://doi.org/10.7155/jgaa.v28i1.2997}
}

RIS

TY  - JOUR
TI  - Finding Near-Optimal Weight Independent Sets at Scale
AU  - Ernestine Großmann
AU  - Sebastian Lamm
AU  - Christian Schulz
AU  - Darren Strash
PY  - 2024
JO  - Journal of Graph Algorithms and Applications
DO  - 10.7155/jgaa.v28i1.2997
UR  - https://doi.org/10.7155/jgaa.v28i1.2997
ER  - 

APA

Großmann, E., Lamm, S., Schulz, C., & Strash, D. (2024). Finding Near-Optimal Weight Independent Sets at Scale. Journal of Graph Algorithms and Applications. https://doi.org/10.7155/jgaa.v28i1.2997

Source records