BibTeX record journals/corr/abs-1806-00791

download as .bib file

@article{DBLP:journals/corr/abs-1806-00791,
  author       = {Benjamin Hellouin de Menibus and
                  Takeaki Uno},
  title        = {Maximal Matching and Path Matching Counting in Polynomial Time for
                  Graphs of Bounded Clique Width},
  journal      = {CoRR},
  volume       = {abs/1806.00791},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.00791},
  eprinttype    = {arXiv},
  eprint       = {1806.00791},
  timestamp    = {Mon, 13 Aug 2018 16:47:33 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-00791.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.