Conditional connectivity of Cayley graphs generated by transposition trees | 2010/11/01 | English | 74 |
Complexity of scheduling tasks with time-dependent execution times | 1993/12/01 | English | 74 |
A Monte Carlo study of pairwise comparison | 1996/01/01 | English | 73 |
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time | 2009/07/01 | English | 72 |
An approximation algorithm for interval data minmax regret combinatorial optimization problems | 2006/03/01 | English | 72 |
Finding the k quickest simple paths in a network | 1994/04/01 | English | 71 |
A fast convex hull algorithm | 1978/08/01 | English | 70 |
Finding paths of length k in time | 2009/02/01 | English | 69 |
Improved gradient-based neural networks for online solution of Lyapunov matrix equation | 2011/08/01 | English | 69 |
Connectivity and edge-disjoint spanning trees | 1983/02/01 | English | 68 |
Subgraph isomorphism, matching relational structures and maximal cliques | 1976/01/01 | English | 68 |
PalmHashing: a novel approach for cancelable biometrics | 2005/01/01 | English | 68 |
A note on the graph isomorphism counting problem | 1979/03/01 | English | 68 |
Good and semi-strong colorings of oriented planar graphs | 1994/08/01 | English | 68 |
BPP and the polynomial hierarchy | 1983/11/01 | English | 67 |
A gradient descent rule for spiking neurons emitting multiple spikes | 2005/09/01 | English | 66 |
Divide and conquer for linear expected time | 1978/02/01 | English | 66 |
Sensitivity analysis of minimum spanning trees and shortest path trees | 1982/03/01 | English | 66 |
Scalable Bloom Filters | 2007/03/01 | English | 65 |
Efficient determination of the transitive closure of a directed graph | 1971/01/01 | English | 65 |
A compression method for clustered bit-vectors | 1978/10/01 | English | 64 |
A unified approach to domination problems on interval graphs | 1988/04/01 | English | 64 |
Linear programming is log-space hard for P | 1979/02/01 | English | 63 |
The causal ordering abstraction and a simple way to implement it | 1991/09/01 | English | 62 |
Convex hull of a finite set of points in two dimensions | 1978/10/01 | English | 62 |
The min-max spanning tree problem and some extensions | 1978/01/01 | English | 62 |
Single machine scheduling with past-sequence-dependent setup times and learning effects | 2007/04/01 | English | 61 |
An algorithm for shortest-path motion in three dimensions | 1985/06/01 | English | 60 |
An O(n) algorithm for the linear multiple choice knapsack problem and related problems | 1984/03/01 | English | 60 |
Scheduling jobs under decreasing linear deterioration | 2005/04/01 | English | 60 |