<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<article key="journals/corr/abs-2204-04117" publtype="informal" mdate="2022-04-13">
<author>Maksim Kitsak</author>
<author>Alexander A. Ganin</author>
<author>Ahmed Elmokashfi</author>
<author>Hongzhu Cui</author>
<author>Daniel A. Eisenberg</author>
<author>David L. Alderson</author>
<author>Dmitry Korkin</author>
<author>Igor Linkov</author>
<title>Finding shortest and nearly shortest path nodes in large substantially incomplete networks.</title>
<year>2022</year>
<volume>abs/2204.04117</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2204.04117</ee>
<url>db/journals/corr/corr2204.html#abs-2204-04117</url>
</article>
</dblp>
