The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Inferring biomolecular interaction networks based on convex optimization (Q935991) (← links)
- A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
- Growing perfect cubes (Q941376) (← links)
- Meshfree thinning of 3D point clouds (Q945012) (← links)
- A genetic algorithm for joint replenishment based on the exact inventory cost (Q947954) (← links)
- Static space-times naturally lead to quasi-pseudometrics (Q949615) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Decision problem for shuffled genes (Q958310) (← links)
- An evolutionary game theoretic perspective on e-collaboration: The collaboration effort and media relativeness (Q958570) (← links)
- Repeated median and hybrid filters (Q959316) (← links)
- An algorithm based on 3-braids to solve tangle equations arising in the action of Gin DNA invertase (Q961559) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- An improved combinatorial approach for pricing Parisian options (Q965783) (← links)
- Direct inversion in the spectral subspace: a novel method for quantitative and qualitative analysis of chemical mixtures (Q965850) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Diameter-preserving spanning trees in sparse weighted graphs (Q968216) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
- The computational complexity of rationalizing behavior (Q972378) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- Ant colony optimization and the minimum spanning tree problem (Q974104) (← links)
- Runtime analysis of a binary particle swarm optimizer (Q974120) (← links)
- Growth constants of minor-closed classes of graphs (Q974473) (← links)
- Fast randomized algorithm for center-detection (Q975164) (← links)
- An approximation algorithm for sequential rectangle placement (Q975504) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- Global and robust formation-shape stabilization of relative sensing networks (Q976211) (← links)
- Kelly criterion revisited: Optimal bets (Q978821) (← links)
- Stochastic dynamic programming applied to hydrothermal power systems operation planning based on the convex hull algorithm (Q980598) (← links)
- Cooperative TSP (Q982655) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Minimizing the expected complete influence time of a social network (Q985076) (← links)
- Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic (Q985144) (← links)
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822) (← links)
- New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm (Q987839) (← links)
- Trees with minimal Laplacian coefficients (Q988244) (← links)
