36 citations · 170 across the 60 of their papers we have counts for
4 papers · 1 filter
A spectral algorithm for finding maximum cliques in dense random intersection graphs
Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos +1
In a random intersection graph , each of vertices selects a random subset of a set of labels by including each label independently with probability and edges…
Single MCMC Chain Parallelisation on Decision Trees
Efthyvoulos Drousiotis, Paul G. Spirakis
Decision trees are highly famous in machine learning and usually acquire state-of-the-art performance. Despite that, well-known variants like CART, ID3, random forest, and boosted…
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
Thekla Hamm, Nina Klobas, George B. Mertzios +1
Temporal graphs naturally model graphs whose underlying topology changes over time. Recently, the problems TEMPORAL VERTEX COVER (or TVC) and SLIDING-WINDOW TEMPORAL VERTEX COVER(o…
The complexity of computing optimum labelings for temporal connectivity
Nina Klobas, George B. Mertzios, Hendrik Molter +1
A graph is temporally connected if there exists a strict temporal path, i.e. a path whose edges have strictly increasing labels, from every vertex to every other vertex . In…