The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Minimal equivalent subgraphs containing a given set of arcs (Q528495) (← links)
- A note on the minimum interval cost flow problem (Q531612) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- Symbolic approximate time-optimal control (Q533800) (← links)
- On centralized smooth scheduling (Q534791) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Finite resolution dynamics (Q535286) (← links)
- Comments on Harn-Lin's cheating detection scheme (Q540475) (← links)
- Sorting and selection on dynamic data (Q541657) (← links)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
- Bayesian inference for queueing networks and modeling of internet services (Q542471) (← links)
- Bounded approximate decentralised coordination via the max-sum algorithm (Q543622) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- How to improve snap-stabilizing point-to-point communication space complexity? (Q555308) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- Distance spectral radius of trees with given matching number (Q602758) (← links)
- Optimal placement of UV-based communications relay nodes (Q604957) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- A local construction of the Smith normal form of a matrix polynomial (Q607157) (← links)
- Design and evaluation of C++ open multi-methods (Q608250) (← links)
- Parallel graph component labelling with GPUs and CUDA (Q608854) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (Q613114) (← links)
- A metaheuristic approach to the optimal definition of molecule-fixed axes in rovibrational Hamiltonians (Q615175) (← links)
- Flexible-attribute problems (Q616800) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times (Q617517) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- Novel matrix forms of rough set flow graphs with applications to data integration (Q630674) (← links)
- Lightweight hybrid tableaux (Q631086) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- Free lunches on the discrete Lipschitz class (Q633702) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- Parallel implementations of Brunotte's algorithm (Q635350) (← links)
- A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity (Q635373) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Searching a bitstream in linear time for the longest substring of any given density (Q644795) (← links)
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture (Q644918) (← links)
