1 citations · 1 across the 8 of their papers we have counts for
8 papers
Efficient maximal cliques enumeration in weakly closed graphs
George Manoussakis
We show that the algorithm presented in [J. Fox, T. Roughgarden, C. Seshadhri, F. Wei, and N. Wein. Finding cliques in social networks: A new distribution-free model. SIAM journal…
The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
George Manoussakis
The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer th…
A self-stabilizing algorithm for maximal matching in link-register model in moves
Johanne Cohen, Georges Manoussakis, Laurence Pilard +1
In the matching problem, each node maintains a pointer to one of its neighbor or to , and a maximal matching is computed when each node points either to a neighbor that itsel…
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching
Johanne Cohen, Khaled Maâmra, George Manoussakis +1
We present the first polynomial self-stabilizing algorithm for finding a -approximation of a maximum matching in a general graph. The previous best known algorithm has bee…
The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in moves. However, the complexity tightness was…
Primitive Zonotopes
Antoine Deza, George Manoussakis, Shmuel Onn
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type . We highlight connections with the largest possible diameter o…
New algorithms for -degenerate graphs
George Manoussakis
A graph is -degenerate if any induced subgraph has a vertex of degree at most . In this paper we prove new algorithms for cliques and similar structures for these graphs. We…
The clique problem on inductive -independent graphs
George Manoussakis
A graph is inductive -independent if there exists and ordering of its vertices such that where is the neighborhood…