There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

There is disagreement on the proper way to label logarithmic scales in charts and graphs, especially when the base is not 10. This post shows several alternative ways of labeling log scales ...

We show that half-graphs are the only essential difficulty, by giving a much stronger version of Szemerédi's Regularity Lemma for models of stable theories of graphs (i.e. graphs with the non-k*-order ...

Kashif Ali, E. T. Baskoro, Ioan Tomescu, On the Ramsey numbers for paths and generalized Jahangir graphs J s,m, Bulletin mathématique de la Société des Sciences Mathématiques de Roumanie, Nouvelle ...