scientific article; zbMATH DE number 3573250

Narsingh Deo, Edward M. Reingold, Jurg Nievergelt

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)

Related Items (only showing first 100 items - show all)

Unnamed Item ⋮ Expected time analysis for Delaunay point location ⋮ Fast gapped variants for Lempel-Ziv-Welch compression ⋮ Approximating finite weighted point sets by hyperplanes ⋮ Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm ⋮ Optimal detection of a counterfeit coin with multi-arms balances ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ A General Approach to Perturbation Theoretic Analysis in Nonlinear Optics and its Application to Ferroelectrics and Antiferroelectrics ⋮ A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL ⋮ On the cardinality of a factor set in the symmetric group ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ A minimization method for boolean functions ⋮ Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem ⋮ The complexity of on-line simulations between multidimensional turing machines and random access machines ⋮ Polynomial solvability of cost-based abduction ⋮ Bayesian methods and optimal experimental design for gene mapping by radiation hybrids ⋮ Ordering the Boolean cube vectors by their weights and with minimal change ⋮ Super-exponentially convergent parallel algorithm for a fractional eigenvalue problem of Jacobi-type ⋮ Aggregation of fuzzy relations of strict order ⋮ Decomposition of a decision-making problem into levels of preference of the majority graph ⋮ On the estimate of the size of a directed graph ⋮ Method of fictitious domains and homotopy as a new alternative to multidimensional partial differential equations in domains of any shape ⋮ Distribution and moments of the weighted sum of uniforms random variables, with applications in reducing monte carlo simulations ⋮ A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems ⋮ A new algorithm for constructing large Carmichael numbers ⋮ Parallel algorithms for connectivity problems in graph theory ⋮ On the complexity of constructing minimum changeover cost arborescences ⋮ Application of the multivariate runs test to compositional data ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Edge $k$-$q$-Colorability of Graphs ⋮ PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) ⋮ Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity ⋮ Unnamed Item ⋮ Parallel discrete invariant embedding algorithm for singular pertubation problems ⋮ Efficient enumeration of cyclic permutations in situ ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ Construction of simple path graphs in transport networks. I: General solutions and examples ⋮ A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS ⋮ A bit-string longest-common-subsequence algorithm ⋮ A comparison of algorithms for exact goodness-of-fit tests for multinomial data ⋮ Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Equal moments division of a set ⋮ An efficient algorithm for software generation of binary linear recurrences ⋮ Using state diagrams for hilbert curve mappings ⋮ Unnamed Item ⋮ The travelling salesman problem: selected algorithms and heuristics† ⋮ DNA codes for nonadditive stem similarity ⋮ Operator matrices generation: Combinatorial structures in finite spin models ⋮ Minimizing maximum flows in linear graphs ⋮ An application of Ramsey's theory to partitions in groups. I ⋮ Minimal enumerations of subsets of a finite set and the middle level problem ⋮ Optimal embeddings of butterfly-like graphs in the hypercube ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Routing multiple paths in hypercubes ⋮ Construction of a topological drawing of the most planar subgraph of the non-planar graph ⋮ Identifiability of directed Gaussian graphical models with one latent source ⋮ A branch-and-Benders-cut approach for the fault tolerant regenerator location problem ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Solving the symmetric tridiagonal eigenvalue problem on hypercubes ⋮ Constraint Satisfaction ⋮ A sparse graph almost as good as the complete graph on points in $k$ dimensions ⋮ Complexity analysis of algorithms by recognition of their classification properties ⋮ Combinatorial compression algorithms for ordered record sequences ⋮ Generating random binary trees -- a survey ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ ``Global graph problems tend to be intractable ⋮ Optimal matching of deformed patterns with positional influence ⋮ A parallel derangement generation algorithm ⋮ Least-cost partition algorithms ⋮ A parallel algorithm for generating combinations ⋮ A systolic generation of combinations ⋮ Backtrack search with isomorph rejection and consistency check ⋮ On solving Travelling Salesman Problem with Vertex Requisitions ⋮ On the transformation semigroups of finite automata ⋮ Method and algorithms for adaptive multiagent resource scheduling in heterogeneous distributed computing environments ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures ⋮ On the NP-hardness of edge-deletion and -contraction problems ⋮ Reflectiveness and compression of threshold transformations ⋮ A simplified correctness proof for a well-known algorithm computing strongly connected components. ⋮ Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube ⋮ Fast enumeration of words generated by Dyck grammars ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION ⋮ Heuristic scheduling of jobs on a multi-product batch processing machine ⋮ Efficient iteration in admissible combinatorial classes ⋮ On optimizing the evaluation of a set of expressions ⋮ Fast algorithms for genegrating integer partitions ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph ⋮ A fast and practical bit-vector algorithm for the longest common subsequence problem ⋮ Parallel algorithm for computing points on a computation front hyperplane ⋮ Permutational labelling of constant weight Gray codes ⋮ Data compression and Gray-code sorting ⋮ The occur-check problem in Prolog ⋮ A new class of parallel algorithms for finding connected components on machines with bit-vector operations ⋮ On the number of edges in the transitive closure of a graph ⋮ A new branch-and-cut approach for the generalized regenerator location problem ⋮ Experimental comparisons of codes for long transportation problems ⋮ Maximum number of disjoint paths connecting specified terminals in a graph ⋮ Ordered priority queues ⋮ Algorithms constructing a representive vector criterion for a binary preference relation

This page was built for publication: