98 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of BucharestRO15 papers
- Institut de Recherche en Informatique FondamentaleFR5 papers
- Kent State UniversityUS5 papers
- Université Paris CitéFR4 papers
- Département d'InformatiqueFR3 papers
- École Normale Supérieure - PSLFR3 papers
- Universitatea Națională de Știință și Tehnologie Politehnica BucureștiRO3 papers
- Telecom Italia LabIT2 papers
- Aix-Marseille UniversitéFR1 paper
- Argosy UniversityUS1 paper
- Beijing Institute for Brain DisordersCN1 paper
- Bucharest Emergency University Hospital1 paper
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani +3
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs and the \emph{anti-Ramsey number}…
cs.CC2018★ 1 cited
Polynomial-time Recognition of 4-Steiner Powers
Guillaume Ducoffe
The -power of a given graph is obtained from by adding an edge between every two distinct vertices at a distance at most in . We call a -Steiner…