scientific article; zbMATH DE number 3573250

Cited in

(only showing first 100 items - show all)

Using state diagrams for hilbert curve mappings
An efficient algorithm for attention-driven image interpretation from segments
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 simplified correctness proof for a well-known algorithm computing strongly connected components.
Parallel algorithms for connectivity problems in graph theory
Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
Efficient iteration in admissible combinatorial classes
The complexity of pursuit on a graph
scientific article; zbMATH DE number 1334602 (Why is no real title available?)
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
Finding fundamental cycles and bridges on a tree-structured parallel computer
Construction of simple path graphs in transport networks. I: General solutions and examples
A new algorithm for constructing large Carmichael numbers
On a generalization of binary search
Combinatorial configurations in balance layout optimization problems
Complexity analysis of algorithms by recognition of their classification properties
Maximum number of disjoint paths connecting specified terminals in a graph
On the transformation semigroups of finite automata
The occur-check problem in Prolog
Dynamic computational geometry on meshes and hypercubes
A linear time bin-packing algorithm
Edge \(k\)-\(q\)-colorability of graphs
Combinatorial optimisation and hierarchical classifications
A note on extending Knuth's tree estimator to directed acyclic graphs
Operator matrices generation: Combinatorial structures in finite spin models
From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
An O(n log n) algorithm for the all-nearest-neighbors problem
Bayesian methods and optimal experimental design for gene mapping by radiation hybrids
Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients
On minimal augmentation of a graph to obtain an interval graph
A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
scientific article; zbMATH DE number 1863838 (Why is no real title available?)
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
Gray codes from antimatroids
Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process
Application of the multivariate runs test to compositional data
Fast enumeration of words generated by Dyck grammars
On the cardinality of a factor set in the symmetric group
Generating random binary trees -- a survey
Formalization of the class of problems solvable by a nondeterministic Turing machine
Construction of a topological drawing of the most planar subgraph of the non-planar graph
Equal moments division of a set
Optimal embeddings of butterfly-like graphs in the hypercube
Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
On the NP-hardness of edge-deletion and -contraction problems
The tree longest detour problem in a biconnected graph.
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
Branch \& Sample: A simple strategy for constraint satisfaction
Aggregation of fuzzy relations of strict order
``Global graph problems tend to be intractable
Construction of Gröbner bases for investigation of systems of polynomial equations
Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
Determining the majority
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
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
A direct method for calculating cell cycles of a block map of a simple planar graph
Efficient enumeration of cyclic permutations in situ
An efficient algorithm for software generation of binary linear recurrences
Sequential decision problems, dependent types and generic solutions
A minimization method for boolean functions
Generating alternating permutations lexicographically
Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
Polynomial solvability of cost-based abduction
The travelling salesman problem: selected algorithms and heuristics†
FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
Explicit definition of the binary reflected Gray codes
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
Decomposition of a decision-making problem into levels of preference of the majority graph
The complexity of on-line simulations between multidimensional turing machines and random access machines
A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
\(q\)-ary Gray codes and weight distributions
Generating binary trees at random
Maintenance of configurations in the plane
A team study of a multiple-power wireless random channel access mechanism with capture effect
On the estimate of the size of a directed graph
Minimizing maximum flows in linear graphs
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
Permutational labelling of constant weight Gray codes
A new algorithm to find the shortest paths between all pairs of nodes
Aspects of insertion in random trees
Fundamental solutions of the eight queens problem
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
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)

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)