scientific article; zbMATH DE number 3573250

Cited in

(only showing first 100 items - show all)

Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
The complexity of determining a shortest cycle of even length
Shape distribution of height-balanced trees
Binary search trees with limited rotation
On generalized Steiner systems and semi-biplanes
A linear time bin-packing algorithm
Data compression and Gray-code sorting
The occur-check problem in Prolog
On the number of edges in the transitive closure of a graph
Experimental comparisons of codes for long transportation problems
Ordered priority queues
Finding fundamental cycles and bridges on a tree-structured parallel computer
Bug distribution and statistical pattern classification
The general maximum matching algorithm of Micali and Vazirani
A note on extending Knuth's tree estimator to directed acyclic graphs
Fixed hypercube embedding
An O(n log n) algorithm for the all-nearest-neighbors problem
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
Branch \& Sample: A simple strategy for constraint satisfaction
Complexity of problems in games, graphs and algebraic equations
An algorithm for imbedding cubic graphs in the torus
Heuristics and their design: A survey
On minimal augmentation of a graph to obtain an interval graph
A new algorithm to find the shortest paths between all pairs of nodes
Maintenance of configurations in the plane
Aspects of insertion in random trees
Fundamental solutions of the eight queens problem
Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
The median procedure in cluster analysis and social choice theory
An optimal algorithm for sink-finding
The complexity of drawing trees nicely
A unique formal system for binary decompositions of database relations, probability distributions, and graphs
Branch-and-bound as a higher-order function
Reducing conflict resolution time for solving graph problems in broadcast communications
A note on inverses of power series
Generating permutations with given ups and downs
Distributed processing of graphs: Fundamental cycles algorithm
Generating binary trees at random
Generating permutations of a bag by interchanges
Understanding the complexity of interpolation search
On a generalization of binary search
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
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
Formalization of the class of problems solvable by a nondeterministic Turing machine
Construction of Gröbner bases for investigation of systems of polynomial equations
Median hyperplanes in normed spaces -- a survey
\(q\)-ary Gray codes and weight distributions
Explicit definition of the binary reflected Gray codes
An application of Ramsey's theory to partitions in groups. II
On counting planar embeddings
Gray codes from antimatroids
Optimal multiprocessor task scheduling using dominance and equivalence relations
A new routing algorithm for cyclic shifts on BRGC hypercubes
A new class of parallel algorithms for finding connected components on machines with bit-vector operations
Maximum number of disjoint paths connecting specified terminals in a graph
Algorithms constructing a representive vector criterion for a binary preference relation
On enumerating all minimal solutions of feedback problems
Off-line algorithms for the list update problem
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
Catastrophic faults in reconfigurable systolic linear arrays
Optimal routing in a transportation network
Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
The tree longest detour problem in a biconnected graph.
Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization
Ranking and unranking permutations in linear time
A fast and practical bit-vector algorithm for the longest common subsequence problem
Super-exponentially convergent parallel algorithm for a fractional eigenvalue problem of Jacobi-type
From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
An efficient algorithm for software generation of binary linear recurrences
Construction of a topological drawing of the most planar subgraph of the non-planar graph
Solving the symmetric tridiagonal eigenvalue problem on hypercubes
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
``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 the transformation semigroups of finite automata
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.
Expected time analysis for Delaunay point location
Optimal detection of a counterfeit coin with multi-arms balances
Construction of simple path graphs in transport networks. I: General solutions and examples
A bit-string longest-common-subsequence algorithm
Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients
Method and algorithms for adaptive multiagent resource scheduling in heterogeneous distributed computing environments
Method of fictitious domains and homotopy as a new alternative to multidimensional partial differential equations in domains of any shape
Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
DNA codes for nonadditive stem similarity
An application of Ramsey's theory to partitions in groups. I

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)