The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Atomistic-to-continuum multiscale modeling with long-range electrostatic interactions in ionic solids (Q748722) (← links)
- Multiplicative update rules for incremental training of multiclass support vector machines (Q763365) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Quantitatively fair scheduling (Q764298) (← links)
- Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
- Tightening the bounds on the Baron's omni-sequence (Q764901) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- The longest almost-increasing subsequence (Q765507) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
- On realizing shapes in the theory of RNA neutral networks (Q776594) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Priority-based scheduling of mixed-critical jobs (Q779444) (← links)
- Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (Q781014) (← links)
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems (Q781286) (← links)
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions (Q830113) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- Wireless sensor networks scheduling for full angle coverage (Q835725) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Proof pearl: Mechanizing the textbook proof of Huffman's algorithm (Q839031) (← links)
- A large deformation mortar formulation of self contact with finite sliding (Q839247) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Preliminary coarse image registration by using straight lines found on them for constructing super resolution mosaics and 3D scene recovery (Q840054) (← links)
- A biobjective optimization model for routing in mobile ad hoc networks (Q840189) (← links)
- What is a sorting function? (Q843213) (← links)
- \(\Delta \)-list vertex coloring in linear time (Q844167) (← links)
- Network topology and locational market power (Q846151) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm (Q846471) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642) (← links)
- Recent development in rigorous computational methods in dynamical systems (Q849189) (← links)
- Robust Hausdorff distance measure for face recognition (Q854204) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Fast mean filtering technique (FMFT) (Q856448) (← links)
- Stability analysis of switched systems using variational principles: An introduction (Q858936) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- A network flow approach to the minimum common integer partition problem (Q861289) (← links)
- Interval-type and affine arithmetic-type techniques for handling uncertainty in expert systems (Q861916) (← links)
- Minimum spanning trees made easier via multi-objective optimization (Q862963) (← links)
