scientific article; zbMATH DE number 3573250

Cited in

(only showing first 100 items - show all)

Complexity of problems in games, graphs and algebraic equations
A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
Generating permutations of a bag by interchanges
Ranking and unranking permutations in linear time
The occur-check problem in Prolog
Data compression and Gray-code sorting
An O(n log n) algorithm for the all-nearest-neighbors problem
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
Efficient memo-table management strategies
Catastrophic faults in reconfigurable systolic linear arrays
Optimal detection of a counterfeit coin with multi-arms balances
Median hyperplanes in normed spaces -- a survey
On the NP-hardness of edge-deletion and -contraction problems
A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
Combinatorial optimisation and hierarchical classifications
Determining the majority
Heuristics and their design: A survey
A bit-string longest-common-subsequence algorithm
Maintenance of configurations in the plane
Fast algorithms for genegrating integer partitions
Parallel algorithms for connectivity problems in graph theory
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Loop-free algorithms for traversing binary trees
Constraint Satisfaction
A fast and practical bit-vector algorithm for the longest common subsequence problem
A parallel algorithm for generating combinations
Dynamic computational geometry on meshes and hypercubes
The complexity of drawing trees nicely
A sparse graph almost as good as the complete graph on points in \(k\) dimensions
A note on the number of perfect matchings of bipartite graphs
Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
Gray codes from antimatroids
On minimal augmentation of a graph to obtain an interval graph
The complexity of determining a shortest cycle of even length
Generating binary trees at random
A new algorithm for generation of permutations
Probabilistic analysis of a grouping algorithm
The general maximum matching algorithm of Micali and Vazirani
Off-line algorithms for the list update problem
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
The Floyd-Warshall algorithm on graphs with negative cycles
The median procedure in cluster analysis and social choice theory
Using state diagrams for hilbert curve mappings
Low order polynomial bounds on the expected performance of local improvement algorithms
Laplacian spectral radius of trees with given maximum degree
Fast gapped variants for Lempel-Ziv-Welch compression
Generalized algorithm for restricted weak composition generation
The topological drawing of a graph: construction methods
Binary search trees with limited rotation
General branch and bound, and its relation to \(A^*\) and \(AO^*\)
Minimizing maximum flows in linear graphs
A comparison of algorithms for exact goodness-of-fit tests for multinomial data
Equal moments division of a set
An algorithm for imbedding cubic graphs in the torus
Super-exponentially convergent parallel algorithm for a fractional eigenvalue problem of Jacobi-type
Combinatorial configurations in balance layout optimization problems
Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
Super-exponentially convergent parallel algorithm for eigenvalue problems with fractional derivatives
Edge \(k\)-\(q\)-colorability of graphs
Bug distribution and statistical pattern classification
Algorithms for the workflow satisfiability problem engineered for counting constraints
Average number of rotations access cost in iR-trees
Graph algorithms on a tree-structured parallel computer
A new algorithm for constructing large Carmichael numbers
The complexity of pursuit on a graph
Expected time analysis for Delaunay point location
Maximum number of disjoint paths connecting specified terminals in a graph
Construction of a topological drawing of the most planar subgraph of the non-planar graph
Understanding the complexity of interpolation search
Distribution and moments of the weighted sum of uniforms random variables, with applications in reducing monte carlo simulations
The complexity of on-line simulations between multidimensional turing machines and random access machines
Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
A unique formal system for binary decompositions of database relations, probability distributions, and graphs
Optimal routing in a transportation network
A new class of parallel algorithms for finding connected components on machines with bit-vector operations
A team study of a multiple-power wireless random channel access mechanism with capture effect
The travelling salesman problem: selected algorithms and heuristics†
On enumerating all minimal solutions of feedback problems
Generating alternating permutations lexicographically
Generating permutations with given ups and downs
Planarity testing and constructing the topological drawing of a plane graph (DFS)
Fast enumeration of words generated by Dyck grammars
\(q\)-ary Gray codes and weight distributions
Syntactic view of sigma-tau generation of permutations
Formalization of the class of problems solvable by a nondeterministic Turing machine
Algorithms constructing a representive vector criterion for a binary preference relation
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
Identifiability of directed Gaussian graphical models with one latent source
FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
scientific article; zbMATH DE number 1863838 (Why is no real title available?)
Solving the symmetric tridiagonal eigenvalue problem on hypercubes
Shape distribution of height-balanced trees
On the number of edges in the transitive closure of a graph
On the cardinality of a factor set in the symmetric group
On generalized Steiner systems and semi-biplanes
Experimental comparisons of codes for long transportation problems
DNA codes for nonadditive stem similarity

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)