.

IRAKLITOS: k-densest subgraphs – cliques – coloring

PERSON IN CHARGE: Zissimopoulos Vassilios
FUNDED BY: EPEAEK
START DATE: 01/10/2003
END DATE: 30/11/2006
DESCRIPTION:
The Densest k-Subgraph Problem
Research > Research Projects