Charalampos E. Tsourakakis

activity

20092025

most citedA Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem

18 citations · 169 across the 45 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

q-bio.QM2012

Perfect Reconstruction of Oncogenetic Trees

Charalampos E. Tsourakakis

In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.

math.CO2012

Rainbow Connectivity of Sparse Random Graphs

Alan Frieze, Charalampos E. Tsourakakis

An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph $G$ ,…