The following pages link to (Q4144192):
Displaying 50 items.
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646) (← links)
- Complexity of problems in games, graphs and algebraic equations (Q1137948) (← links)
- An algorithm for imbedding cubic graphs in the torus (Q1140090) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- A new algorithm to find the shortest paths between all pairs of nodes (Q1157967) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Aspects of insertion in random trees (Q1160488) (← links)
- Fundamental solutions of the eight queens problem (Q1161301) (← links)
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- An optimal algorithm for sink-finding (Q1165583) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1177386) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491) (← links)
- A note on inverses of power series (Q1185978) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- Distributed processing of graphs: Fundamental cycles algorithm (Q1186357) (← links)
- Generating binary trees at random (Q1186567) (← links)
- Generating permutations of a bag by interchanges (Q1197979) (← links)
- Understanding the complexity of interpolation search (Q1245570) (← links)
- On a generalization of binary search (Q1253101) (← links)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112) (← links)
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance (Q1270819) (← links)
- Formalization of the class of problems solvable by a nondeterministic Turing machine (Q1280876) (← links)
- Construction of Gröbner bases for investigation of systems of polynomial equations (Q1280894) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- \(q\)-ary Gray codes and weight distributions (Q1294219) (← links)
- Explicit definition of the binary reflected Gray codes (Q1296989) (← links)
- An application of Ramsey's theory to partitions in groups. II (Q1313424) (← links)
- On counting planar embeddings (Q1313885) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Optimal multiprocessor task scheduling using dominance and equivalence relations (Q1318466) (← links)
- A new routing algorithm for cyclic shifts on BRGC hypercubes (Q1318732) (← links)
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
- Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394) (← links)
- Algorithms constructing a representive vector criterion for a binary preference relation (Q1343006) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem (Q1362516) (← links)
- Catastrophic faults in reconfigurable systolic linear arrays (Q1363642) (← links)
- Optimal routing in a transportation network (Q1390277) (← links)
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups (Q1403877) (← links)
- The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
- Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization (Q1587402) (← links)
- Ranking and unranking permutations in linear time (Q1603397) (← links)
