Â

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)

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

- Silvio Franz
- 2008

We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains areâ€¦Â (More)

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)

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?