Beating Treewidth for Average-Case Subgraph Isomorphism

Gregory Rosenthal. Beating Treewidth for Average-Case Subgraph Isomorphism. Algorithmica, 83(8):2521-2551, 2021. [doi]

@article{Rosenthal21-0,
  title = {Beating Treewidth for Average-Case Subgraph Isomorphism},
  author = {Gregory Rosenthal},
  year = {2021},
  doi = {10.1007/s00453-021-00813-y},
  url = {https://doi.org/10.1007/s00453-021-00813-y},
  researchr = {https://researchr.org/publication/Rosenthal21-0},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {83},
  number = {8},
  pages = {2521-2551},
}