Hi,
Welcome to the forum!
Here is the powerpoint presentation about TKG:
http://www.philippe-fournier-viger.com/TKG_frequent_subgraph_mining.pdf
The article:
http://www.philippe-fournier-viger.com/2019_BDA_TKG_Top-k-subgraphs.pdfTo understand the basic idea about TKG, it is good to know first about how gSpan works, since TKG is an extension of GSpan. For this, I recommend to read the chapter about subgraph mining in the book of Mohamed Zaki (for free). It has a good example of how gSpan is working.
https://dataminingbook.info/book_html/chap11/book-watermark.htmlThen, you can think about TKG as a modification of GSpan to turn it into a top-k algorithm.
I may do a video about TKG later. It is a good idea. But now a little busy!
Best regards,
Philippe