The following pages link to (Q4144192):
Displaying 50 items.
- Super-exponentially convergent parallel algorithm for eigenvalue problems with fractional derivatives (Q323930) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- Generalized algorithm for restricted weak composition generation (Q387319) (← links)
- A team study of a multiple-power wireless random channel access mechanism with capture effect (Q460252) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Efficient memo-table management strategies (Q582879) (← links)
- Generating alternating permutations lexicographically (Q583885) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- A note on the number of perfect matchings of bipartite graphs (Q678856) (← links)
- Determining the majority (Q688232) (← links)
- Combinatorial configurations in balance layout optimization problems (Q722043) (← links)
- Probabilistic analysis of a grouping algorithm (Q749213) (← links)
- Loop-free algorithms for traversing binary trees (Q786538) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- A new algorithm for generation of permutations (Q795511) (← links)
- Average number of rotations access cost in iR-trees (Q797286) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- The mathematics of modems (Q807598) (← links)
- A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra (Q852627) (← links)
- Partial sum problem mapping into a hypercube (Q918652) (← links)
- A universal table model for categorical databases (Q918682) (← links)
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search (Q921925) (← links)
- On generation of permutations through decomposition of symmetric groups into cosets (Q922698) (← links)
- On evaluation of the blocking probability in multiwave time division multiplexing networks (Q946024) (← links)
- Laplacian spectral radius of trees with given maximum degree (Q947660) (← links)
- An efficient algorithm for attention-driven image interpretation from segments (Q955836) (← links)
- Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process (Q956526) (← links)
- The Floyd-Warshall algorithm on graphs with negative cycles (Q991782) (← links)
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (Q1025522) (← links)
- The complexity of determining a shortest cycle of even length (Q1052821) (← links)
- Shape distribution of height-balanced trees (Q1054157) (← links)
- Binary search trees with limited rotation (Q1056233) (← links)
- On generalized Steiner systems and semi-biplanes (Q1060416) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- Data compression and Gray-code sorting (Q1075764) (← links)
- The occur-check problem in Prolog (Q1077912) (← links)
- On the number of edges in the transitive closure of a graph (Q1080862) (← links)
- Experimental comparisons of codes for long transportation problems (Q1086155) (← links)
- Ordered priority queues (Q1091146) (← links)
- Finding fundamental cycles and bridges on a tree-structured parallel computer (Q1093373) (← links)
- Bug distribution and statistical pattern classification (Q1104678) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- A note on extending Knuth's tree estimator to directed acyclic graphs (Q1108027) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
