The following pages link to Encyclopedia of Algorithms (Q5899531):
Displaying 14 items.
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- A new representation of algorithmic approaches in the AlgoWiki encyclopedia (Q2046389) (← links)
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2232246) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Models in quantum computing: a systematic review (Q2687125) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5091155) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Encyclopedia of Algorithms (Q5900149) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay (Q6124426) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)
