The following pages link to (Q4144192):
Displaying 41 items.
- Optimal embeddings of butterfly-like graphs in the hypercube (Q3355251) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Equal moments division of a set (Q3577019) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- A Parallel Algorithm for Cost-Optimal Generation of Permutations of<i>r</i>out of<i>n</i>Items (Q3792260) (← links)
- Parallel algorithms for connectivity problems in graph theory (Q3802645) (← links)
- Efficient enumeration of cyclic permutations in situ (Q3826556) (← links)
- Minimizing maximum flows in linear graphs (Q3865814) (← links)
- On optimizing the evaluation of a set of expressions (Q3947169) (← links)
- On random and adaptive parallel generation of combinatorial objects (Q3989785) (← links)
- A minimization method for boolean functions (Q4007343) (← links)
- Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem (Q4007453) (← links)
- The complexity of on-line simulations between multidimensional turing machines and random access machines (Q4013406) (← links)
- Bayesian methods and optimal experimental design for gene mapping by radiation hybrids (Q4031042) (← links)
- Heuristic scheduling of jobs on a multi-product batch processing machine (Q4230214) (← links)
- Fast algorithms for genegrating integer partitions (Q4236115) (← links)
- On the complexity of branch-and-bound search for random trees (Q4262221) (← links)
- Parallel discrete invariant embedding algorithm for singular pertubation problems (Q4375417) (← links)
- A comparison of algorithms for exact goodness-of-fit tests for multinomial data (Q4387693) (← links)
- Constraint Satisfaction (Q4452903) (← links)
- Edge $k$-$q$-Colorability of Graphs (Q4637664) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- A bit-counting algorithm using the frequency division principle (Q4791045) (← links)
- A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL (Q4820168) (← links)
- Distribution and moments of the weighted sum of uniforms random variables, with applications in reducing monte carlo simulations (Q4869597) (← links)
- A new algorithm for constructing large Carmichael numbers (Q4878584) (← links)
- On solving Travelling Salesman Problem with Vertex Requisitions (Q4987704) (← links)
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube (Q5013468) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm (Q5060054) (← links)
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) (Q5150740) (← links)
- A General Approach to Perturbation Theoretic Analysis in Nonlinear Optics and its Application to Ferroelectrics and Antiferroelectrics (Q5312181) (← links)
- A direct method for calculating cell cycles of a block map of a simple planar graph (Q5871440) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- Operator matrices generation: Combinatorial structures in finite spin models (Q5950522) (← links)
- Minimal enumerations of subsets of a finite set and the middle level problem (Q5954085) (← links)
- Identifiability of directed Gaussian graphical models with one latent source (Q5965329) (← links)
- Ordering the Boolean cube vectors by their weights and with minimal change (Q6108718) (← links)
- Decomposition of a decision-making problem into levels of preference of the majority graph (Q6178115) (← links)
- Complementarity in finite quantum mechanics and computer-aided computations of complementary observables (Q6535144) (← links)
