scientific article; zbMATH DE number 5542185
From MaRDI portal
Publication:3619797
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Randomized algorithms (68W20) Analysis of algorithms (68W40) Linear programming (90C05)
Cited in
(only showing first 100 items - show all)- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Knowledge condition games
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
- Minimum-link watchman tours
- A hierarchical model for rate-dependent polycrystals
- A sufficient condition for the liveness of weighted event graphs
- Algorithms for maximum independent set in convex bipartite graphs
- Labeling schemes for tree representation
- A practical approximation algorithm for the LMS line estimator
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Boolean circuit programming: A new paradigm to design parallel algorithms
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- A polynomial solvable minimum risk spanning tree problem with interval data
- Optimality conditions in preference-based spanning tree problems
- Hypergraph decomposition and secret sharing
- Computing the update of the repeated median regression line in linear time
- Finding optimal paths in MREP routing
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Kinetic hanger
- The worst-case chip problem
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
- \((r,p)\)-centroid problems on paths and trees
- Maximum weight bipartite matching in matrix multiplication time
- Adaptive synchronization of a network of interconnected nonlinear Lur'e systems
- Optimal and online preemptive scheduling on uniformly related machines
- On Hamiltonian cycles and Hamiltonian paths
- A survey on the complexity of tournament solutions
- Analysis and synthesis of controlled delay lines
- The generalized hierarchical product of graphs
- Average-optimal string matching
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
- The bulk-synchronous parallel random access machine
- Exact calculations for the repeated many-one test.
- Homology computation by reduction of chain complexes
- A fast algorithm for finding the compact sets
- Scheduling on a hypercube
- Fast average-case pattern matching by multiplexing sparse tables
- Approximate string-matching with q-grams and maximal matches
- Fast computation of the Euclidean distance maps for binary images
- On the complexity of blocks-world planning
- A generic arc-consistency algorithm and its specializations
- Stacks, queues, and deques with order-statistic operations
- An optimal algorithm for finding compact sets
- An optimal algorithm for the period of a strongly connected digraph
- Computing fence designs for orienting parts
- Transforming a single-valued transducer into a Mealy machine
- On a scheduling problem of time deteriorating jobs
- Spheres, molecules, and hidden surface removal
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- Methods for task allocation via agent coalition formation
- Strictly-upward drawings of ordered search trees
- Approximate maxima finding of continuous functions under restricted budget
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Communication complexity of fault-tolerant information diffusion
- On the hardness of allocating frequencies for hybrid networks
- An optimization problem in virtual endoscopy
- Label placement by maximum independent set in rectangles
- A dynamic programming heuristic for the \(P\)-median problem
- Vectorized search for single clusters
- Partial and perfect path covers of cographs
- A 2_3² superstring approximation algorithm
- On the complexity and approximation of syntenic distance
- On the definition and the construction of pockets in macromolecules
- Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT)
- Minimal connected enclosures on an embedded planar graph
- Minimizing broadcast costs under edge reductions in tree networks
- Fixed topology Steiner trees and spanning forests
- Random sampling and greedy sparsification for matroid optimization problems
- Minimizing average completion time in the presence of release dates
- Timing conditions for linearizability in uniform counting networks
- Computation of incompressible flows with implicit finite element implementations on the Connection Machine
- Determining uni-connectivity in directed graphs
- Computation of the solutions of nonlinear polynomial systems
- Flow in planar graphs with vertex capacities
- A note on bitonic sorting
- Efficient management of dynamic tables
- A derived algorithm for evaluating -expressions over abstract sets
- Model checking and boolean graphs
- Improved parallel solution of a triangular linear system
- Efficient distribution-free learning of probabilistic concepts
- Computing matrix-valued Nevanlinna-Pick interpolation
- Some geometric applications of Dilworth's theorem
- Constructing competitive tours from local information
- A calculus for the random generation of labelled combinatorial structures
- Proving theorems of the second order Lambek calculus in polynomial time
- The minimum feature set problem
- Average-case scalable on-line algorithms for fault replacement
- Mellin transforms and asymptotics. The mergesort recurrence
- The representation of permutations by trees
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- An incremental concept formation approach for learning from databases
- Speedup of determinism by alternation for multidimensional Turing machines
- Topologically reliable approximation of composite Bézier curves
- An efficient algorithm for concurrent priority queue heaps
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
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 Q3619797)
