scientific article; zbMATH DE number 3573250

zbMATH Open0367.68032MaRDI QIDQ4144192FDOQ4144192

Narsingh Deo, Edward M. Reingold, Jurg Nievergelt

Publication date: 1977

Title of this publication is not available (Why is that?)

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

Cited In (only showing first 100 items - show all)

A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
Parallel algorithms for connectivity problems in graph theory
Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
A new algorithm for constructing large Carmichael numbers
The complexity of pursuit on a graph
Combinatorial configurations in balance layout optimization problems
Maximum number of disjoint paths connecting specified terminals in a graph
The occur-check problem in Prolog
Combinatorial optimisation and hierarchical classifications
Dynamic computational geometry on meshes and hypercubes
An O(n log n) algorithm for the all-nearest-neighbors problem
On minimal augmentation of a graph to obtain an interval graph
Gray codes from antimatroids
Equal moments division of a set
Construction of a topological drawing of the most planar subgraph of the non-planar graph
On the NP-hardness of edge-deletion and -contraction problems
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
Determining the majority
The complexity of determining a shortest cycle of even length
General branch and bound, and its relation to $A^*$ and $AO^*$
Bug distribution and statistical pattern classification
Efficient memo-table management strategies
Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
The travelling salesman problem: selected algorithms and heuristics†
Generating alternating permutations lexicographically
The complexity of on-line simulations between multidimensional turing machines and random access machines
Optimal detection of a counterfeit coin with multi-arms balances
A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
A new algorithm for generation of permutations
Maintenance of configurations in the plane
Generating binary trees at random
Minimizing maximum flows in linear graphs
A team study of a multiple-power wireless random channel access mechanism with capture effect
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Probabilistic analysis of a grouping algorithm
The general maximum matching algorithm of Micali and Vazirani
Off-line algorithms for the list update problem
Super-exponentially convergent parallel algorithm for eigenvalue problems with fractional derivatives
Algorithms for the workflow satisfiability problem engineered for counting constraints
A unique formal system for binary decompositions of database relations, probability distributions, and graphs
Generating permutations with given ups and downs
Generating permutations of a bag by interchanges
Expected time analysis for Delaunay point location
Catastrophic faults in reconfigurable systolic linear arrays
A fast and practical bit-vector algorithm for the longest common subsequence problem
A parallel algorithm for generating combinations
A sparse graph almost as good as the complete graph on points in $k$ dimensions
Complexity of problems in games, graphs and algebraic equations
Data compression and Gray-code sorting
Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
Edge $k$-$q$-Colorability of Graphs
Constraint Satisfaction
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
A bit-string longest-common-subsequence algorithm
A comparison of algorithms for exact goodness-of-fit tests for multinomial data
The Floyd-Warshall algorithm on graphs with negative cycles
An algorithm for imbedding cubic graphs in the torus
Optimal routing in a transportation network
On enumerating all minimal solutions of feedback problems
Loop-free algorithms for traversing binary trees
An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
Median hyperplanes in normed spaces -- a survey
Fast gapped variants for Lempel-Ziv-Welch compression
Super-exponentially convergent parallel algorithm for a fractional eigenvalue problem of Jacobi-type
Average number of rotations access cost in iR-trees
Graph algorithms on a tree-structured parallel computer
Ranking and unranking permutations in linear time
The median procedure in cluster analysis and social choice theory
Binary search trees with limited rotation
Heuristics and their design: A survey
The complexity of drawing trees nicely
Low order polynomial bounds on the expected performance of local improvement algorithms
Understanding the complexity of interpolation search
Fast algorithms for genegrating integer partitions
Laplacian spectral radius of trees with given maximum degree
Generalized algorithm for restricted weak composition generation
The topological drawing of a graph: construction methods
A new class of parallel algorithms for finding connected components on machines with bit-vector operations
A note on the number of perfect matchings of bipartite graphs
Using state diagrams for hilbert curve mappings
Distribution and moments of the weighted sum of uniforms random variables, with applications in reducing monte carlo simulations
Reflectiveness and compression of threshold transformations
On evaluation of the blocking probability in multiwave time division multiplexing networks
Method of fictitious domains and homotopy as a new alternative to multidimensional partial differential equations in domains of any shape
On optimizing the evaluation of a set of expressions
On the number of edges in the transitive closure of a graph
Experimental comparisons of codes for long transportation problems
Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization
Title not available (Why is that?)
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
An efficient algorithm for attention-driven image interpretation from segments
A simplified correctness proof for a well-known algorithm computing strongly connected components.
Efficient iteration in admissible combinatorial classes
Title not available (Why is that?)
Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem
A new branch-and-cut approach for the generalized regenerator location problem
Construction of simple path graphs in transport networks. I: General solutions and examples
Finding fundamental cycles and bridges on a tree-structured parallel computer

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144192)