Fast counting of medium-sized rooted subgraphs
From MaRDI portal
Publication:6281444
arXiv1701.00177MaRDI QIDQ6281444
Pierre-André G. Maugis, Patrick J. Wolfe, Sofia C. Olhede
Publication date: 31 December 2016
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
This page was built for publication: Fast counting of medium-sized rooted subgraphs
