Clinical Paths

Known as: Clinical Path, Path, Clinical, Paths, Clinical 
 
National Institutes of Health

Topic mentions per year

Topic mentions per year

1995-2010
0119952010

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We present a search algorithm, called K∗, for finding the k shortest paths (KSP) between a designated pair of vertices in a given… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
In the all pairs bottleneck paths (APBP) problem, one is given a directed graph with real weights on its edges. Viewing the… (More)
Is this relevant?
2008
2008
We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains are… (More)
  • figure 1
  • figure 2
Is this relevant?
Review
1996
Review
1996
  • Dimitris J. KavvadiasComputer
  • 1996
We show how to decompose e ciently in parallel any graph into a number, ~ , of outerplanar subgraphs (called hammocks) satisfying… (More)
  • figure 3.1
  • figure 3.3
  • figure 3.4
  • figure 4.1
  • figure 4.2
Is this relevant?
1995
1995
  • W..., BranderM, C. ., SinclairDept
  • 1995
EEcient management of networks requires that the shortest route from one point (node) to another is known; this is termed the… (More)
Is this relevant?