Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Johnson's algorithm

Known as: Johnson algorithm 
Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse, edge weighted, directed graph. It allows some of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
La funcion de scheduling se fundamenta en la asignacion de recursos limitados a tareas a lo largo del tiempo y tiene como… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The false-positive probability (FPP) of Kepler transiting candidates is a key value for statistical studies of candidate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
In their paper "Tight bound on Johnson's algorithm for maximum satisfiability" [J. Comput. System Sci. 58 (3) (1999) 622-640… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Abstract. Dantzig, Fulkerson, and Johnson (1954) introduced the cutting-plane method as a means of attacking the traveling… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1999
1999
We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability… Expand
  • figure 1
Is this relevant?
1999
1999
Scheduling consists mainly of allocating resources to jobs over time under necessary constraints. In the past, the processing… Expand
Is this relevant?
1998
1998
We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
1997
1997
We present a new technique that gives a more thorough analysis on Johnson's classical algorithm for the maximum satisfiability… Expand
  • figure 1
  • figure 2
Is this relevant?
1996
1996
A handle for a catheter, comprising a marking arrangement using index markings which can be read through a window. The window is… Expand
Is this relevant?
1984
1984
Pelo fato de ser a analise multivariada menos conveniente que a univariada para estudos geneticos de heranca, procurou-se… Expand
  • figure 1
Is this relevant?