Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

Abstract Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We present a novel approach to relation extraction, based on the observation that the information required to assert a… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a… Expand

Is this relevant?

Highly Cited

1969

Highly Cited

1969

This paper treats five discrete shortest-path problems: 1 determining the shortest path between two specified nodes of a network… Expand

Is this relevant?