Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Koana, Tomohiro; Komusiewicz, Christian; Sommer, Frank

doi:10.4230/LIPICS.ISAAC.2020.20

by Tomohiro Koana, Christian Komusiewicz, Frank Sommer

Reference:

Computing Dense and Sparse Subgraphs of Weakly Closed GraphsTomohiro Koana, Christian Komusiewicz, Frank Sommer31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao, Siu-Wing Cheng, Minming Li, eds.), volume 181 of LIPIcs, pages 20:1–20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{KoanaKS20a,
  author       = {Tomohiro Koana and
                  Christian Komusiewicz and
                  Frank Sommer},
  editor       = {Yixin Cao and
                  Siu{-}Wing Cheng and
                  Minming Li},
  title        = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
  booktitle    = {31st International Symposium on Algorithms and Computation, {ISAAC}
                  2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {181},
  pages        = {20:1--20:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.20},
  doi          = {10.4230/LIPICS.ISAAC.2020.20}
}