The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We present parallel algorithms on the BSP/CGM model, with processors,
to count and generate all the maximal cliques of a circle graph with vertices
and edges.
To count the number of all the maximal cliques, without actually
generating them, our algorithm requires (log ) communication
rounds with (/) local computation time.
We also present an algorithm to generate the first maximal clique in
(log ) communication rounds with (/) local computation,
and to generate each one of the subsequent...
Download Results (CSV)