Searching for smallest universal graphs and tournaments with SAT

Zhang, Tianwei; Szeider, Stefan

doi:10.4230/LIPICS.CP.2023.39

by Tianwei Zhang, Stefan Szeider

Reference:

Searching for smallest universal graphs and tournaments with SATTianwei Zhang, Stefan SzeiderProceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@InProceedings{ZhangSzeider23,
  author       = {Tianwei Zhang and Stefan Szeider},
  title        = {Searching for smallest universal graphs and tournaments with {SAT}},
  booktitle = {Proceedings of CP 2023, the 29th International
                  Conference on Principles and Practice of Constraint
                  Programming},
  year      = {2023},
  editor    = {Roland Yap},
  series    = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
volume       = {280},
  pages        = {39:1--39:20},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.CP.2023.39},
  doi          = {10.4230/LIPICS.CP.2023.39},
  keywords  ={reveal,cofund}, 
}