The following pages link to (Q3619797):
Displaying 50 items.
- The hierarchical hub labeling is non-efficient (Q255772) (← links)
- Numerical solution of dual-phase-lagging heat conduction model for analyzing overshooting phenomenon (Q273382) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Computing strictly-second shortest paths (Q287170) (← links)
- Fair on-line scheduling of a dynamic set of tasks on a single resource (Q287232) (← links)
- Route selection with multiple metrics (Q290274) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- Estimating the range of a function in an online setting (Q294695) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Updating \(\leqslant, <\)-chains (Q294886) (← links)
- Code optimization in FORM (Q312006) (← links)
- Similarity based deduplication with small data chunks (Q313748) (← links)
- Optimal partitioning of data chunks in deduplication systems (Q313775) (← links)
- Resource loading with time windows (Q319369) (← links)
- On a class of decision diagrams (Q329079) (← links)
- An approach to solution of the movements routing problem with several participants (Q357112) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Multi-postpath-based lookahead multiconstraint QoS routing (Q378623) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- The topology aware file distribution problem (Q386444) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems (Q395472) (← links)
- Scheduling modular projects on a bottleneck resource (Q398901) (← links)
- Nonlinear dimensionality reduction by topologically constrained isometric embedding (Q408807) (← links)
- Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets (Q409122) (← links)
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling (Q411217) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- Mismatch sampling (Q418198) (← links)
- A binary-tree based model for rate-independent polycrystals (Q422519) (← links)
- The complexity of flood-filling games on graphs (Q423894) (← links)
- Detecting low-rank clusters via random sampling (Q425614) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (Q437040) (← links)
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535) (← links)
- A survey on multi-objective evolutionary algorithms for many-objective problems (Q457238) (← links)
- Maximizing the set of recurrent states of an MDP subject to convex constraints (Q462403) (← links)
- Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) (Q465989) (← links)
- The stability of barycentric interpolation at the Chebyshev points of the second kind (Q466049) (← links)
- Estimates for eigenvalues of stochastic matrices (Q475702) (← links)
- Computing the probabilities of HLA-like matching (Q478029) (← links)
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Spanning trees and the complexity of flood-filling games (Q489766) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
- Improving deduplication techniques by accelerating remainder calculations (Q496547) (← links)
- A new approach for solving the network problems (Q505104) (← links)
