3 citations · 5 across the 3 of their papers we have counts for
3 papers
On the existence of -temporal cliques in random simple temporal graphs
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos +1
We consider random simple temporal graphs in which every edge of the complete graph appears once within the time interval [0,1] independently and uniformly at random. Our mai…
Determining Majority in Networks with Local Interactions and very Small Local Memory
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos +1
We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types. The vertices may have a few add…
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
S. Nikoletseas, C. Raptopoulos, P. G. Spirakis
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph).…