Pathlength scaling in graphs with incomplete navigational information

2011. Physica A 390:3996-4001. The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigab

Read more

Completed: Future health - digital transformation

Swedish health care delivers good outcomes for specialized diagnoses, but are experiencing problems when it comes to the easiest and the toughest cases. Patients with the easiest problems have difficu

Read more