Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs

Wang, Kai; Zhao, Gengda; Zhang, Wenjie; Lin, Xuemin; Zhang, Ying; He, Yizhang; Li, Chunxiao

doi:10.1109/tkde.2023.3234567

Cited by 7 publications

(1 citation statement)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are also increasing interests in subgraph enumeration problem on the types of graphs, such as streaming graphs [82,144,146,177], bipartite graphs [4,31,42,106,107,176,[180][181][182], temporal graphs [92][93][94], uncertain graphs [41,161,163] and etc. For the studies that target the streaming graphs and temporal graphs, the techniques are similar to those of subgraph matching problem on general graphs.…”

Section: Subgraph Enumeration On Other Types Of Graphsmentioning

confidence: 99%

Efficient algorithms for subgraph counting and enumeration on large graphs

Wang

View full text Add to dashboard Cite

Foremost, I would like to express my deepest gratitude to my supervisor, Prof. Cheng Long. His unparalleled expertise, passionate guidance, and relentless commitment have illuminated the path of my Ph. D journey. His insightful feedback, patient mentorship, and steadfast support have not only expanded my horizon but also cultivated a spirit of curiosity, rigor, and excellence that will resonate within me throughout my future career.To my cherished colleagues, their camaraderie, collaboration, and collective passion for research have transformed challenges into opportunities, fostering an environment of innovation, exploration, and growth. The invaluable insights, constructive discussions, and shared experiences have not only enriched this thesis but also cultivated enduring friendships and memories that I will forever treasure.

show abstract