Introduction to algorithms
From MaRDI portal
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Region-restricted clustering for geographic data mining
- The labeled maximum matching problem
- Combining computation and data transmission in the systems with switches
- On the coverings of the \(d\)-cube for \(d\leq 6\)
- Topological sweep of the complete graph
- Periodic schedules for linear precedence constraints
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- Faster pattern matching with character classes using prime number encoding
- A linearly convergent method for broadcast data allocation
- On the pseudo-achromatic number problem
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
- On comparing two sequences of numbers and its applications to clustering analysis
- A simple graphical approach for understanding probabilistic inference in Bayesian networks
- Augmented reality on cloth with realistic illumination
- Bayesian learning of graphical vector autoregressions with unequal lag-lengths
- A complex network approach to text summarization
- Network flow formulation of optimal perimeter sensory coverage problem
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Temporal logic motion planning for dynamic robots
- Detecting critical nodes in sparse graphs
- Minimizing the sum of job completion times on capacitated two-parallel machines
- A faster strongly polynomial time algorithm for submodular function minimization
- Bandwidth-constrained allocation in grid computing
- Red-blue covering problems and the consecutive ones property
- The \(S\)-digraph optimization problem and the greedy algorithm
- Index calculus in class groups of non-hyperelliptic curves of genus three
- An external-memory depth-first search algorithm for general grid graphs
- Hierarchical multiresolution approaches for dense point-level breast cancer treatment data
- Sorting networks of logarithmic depth, further simplified
- Single facility collection depots location problem in the plane
- Dynamic ham-sandwich cuts in the plane
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
- Treelike comparability graphs
- Fast incremental algorithm for speeding up the computation of binarization
- Generalized matrix inversion is not harder than matrix multiplication
- Combinatorial optimization in system configuration design
- On the relation among answer set solvers
- On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition
- Don't care words with an application to the automata-based approach for real addition
- Clamshell casting
- Pairwise compatibility graphs
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
- Instability, complexity, and evolution
- Two-stage flexible-choice problems under uncertainty
- Measuring and computing natural generators for homology groups
- Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem
- The submodular knapsack polytope
- An improved algorithm for online unit clustering
- Data compression for proof replay
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- Detecting palindromes, patterns and borders in regular languages
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds
- An algorithm for computing the restriction s|caffold assignment problem in computational biology
- Heuristic methods for the sectoring arc routing problem
- Nash equilibria in all-optical networks
- Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
- On the round complexity of Byzantine agreement without initial set-up
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- A new heuristic for task scheduling in heterogeneous computing environment
- Two flow network simplification algorithms
- Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
- Fast convolution and fast Fourier transform under interval and fuzzy uncertainty
- An efficient simulation algorithm based on abstract interpretation
- A fast algorithm for computing distance correlation
- Half-trek criterion for generic identifiability of linear structural equation models
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Dimension-reduced nonparametric maximum likelihood computation for interval-censored data
- Identification of function distinguishable languages.
- PC trees and circular-ones arrangements.
- Progressive scattered data filtering.
- Geometry of minimum spanning trees on scale-free networks
- Arbitrage risk induced by transaction costs
- Trees and jumps and real roots.
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Approximation algorithms for some optimum communication spanning tree problems
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
- Leader selection for strong structural controllability of single-integrator multi-agent systems
- Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
- Structural relatedness via flow networks in protein sequence space
- Phylogenetic estimation with partial likelihood tensors
- A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling
- Domination in some subclasses of bipartite graphs
- Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
- Approximations of arbitrary relations by partial orders
- An algorithm for autonomously plotting solution sets in the presence of turning points
- Forming \(k\) coalitions and facilitating relationships in social networks
- Reverse selective obnoxious center location problems on tree graphs
- An effective iterated tabu search for the maximum bisection problem
- Hybrid genetic algorithm for the open capacitated arc routing problem
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- A segmentation-based algorithm for large-scale partially ordered monotonic regression
- On decomposability of multilinear sets
- On the reconstruction of three-dimensional protein structures from contact maps
- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
- Clock synchronization in wireless sensor networks: analysis and design of error precision based on lossy networked control perspective
- Models and algorithms for optimal piecewise-linear function approximation
This page was built for publication: Introduction to algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747613)
