CsAuthors.net's algorithm finds the shortest co-authorship path between two authors. A co-authorship
path is defined as a list of authors such that each pair of neighboring authors on that list
co-authored at least a paper.

In cases where there exists different paths between two authors having a minimal length, the system will
select the path such that the sum of the logarithms of the number of collaborations between authors
is the highest.

In cases where no co-authorship path exists between two authors, the system reports an infinite
distance between them (denoted using the mathematical symbol "∞"). This situation is relatively rare
since currently 89.5% users are in the same connected
subset of the graph.

*Additional remarks about the dataset:*
Most of the data is coming from the

DBLP Computer Science Bibliography
and the rest is coming from CsAuthors.net own database.

Hence the hard work being done to keep everything up-to-date, many papers are not
yet included in CsAuthors's dataset.

If something is wrong or missing, feel free to write at at

my email address

.

## share this: