3 papers
cs.SI2022
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations
Ali Baran Taşdemir, Tuna Karacan, Emir Kaan Kırmacı +1
Approximate solutions to various NP-hard combinatorial optimization problems have been found by learned heuristics using complex learning models. In particular, vertex (node) class…
cs.SI2022
Low-Rank Representations Towards Classification Problem of Complex Networks
Murat Çelik, Ali Baran Taşdemir, Lale Özkahya
Complex networks representing social interactions, brain activities, molecular structures have been studied widely to be able to understand and predict their characteristics as gra…
cs.SI2020
A Fast Counting Method for 6-motifs with Low Connectivity
Taha Sevim, Muhammet Selçuk Güvel, Lale Özkahya
A -motif (or graphlet) is a subgraph on nodes in a graph or network. Counting of motifs in complex networks has been a well-studied problem in network analysis of various re…