A new decomposition technique for maximal clique enumeration for sparse graphs

From MaRDI portal
Publication:1740688

DOI10.1016/j.tcs.2018.10.014zbMath1421.68138OpenAlexW2897305385MaRDI QIDQ1740688

George Manoussakis

Publication date: 2 May 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.014




Related Items (3)


Uses Software


Cites Work


This page was built for publication: A new decomposition technique for maximal clique enumeration for sparse graphs