BibTeX record journals/ipl/YuL17

download as .bib file

@article{DBLP:journals/ipl/YuL17,
  author       = {Ting Yu and
                  Mengchi Liu},
  title        = {A linear time algorithm for maximal clique enumeration in large sparse
                  graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {35--40},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.05.005},
  doi          = {10.1016/J.IPL.2017.05.005},
  timestamp    = {Wed, 10 Aug 2022 08:02:12 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/YuL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.