Branch-and-bound and backtrack search on mesh-connected arrays of processors (Q4311641): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138971 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Tree Embeddings in Butterflies and Hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sorting on a mesh-connected parallel computer / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 10:04, 23 May 2024
scientific article; zbMATH DE number 679589
Language | Label | Description | Also known as |
---|---|---|---|
English | Branch-and-bound and backtrack search on mesh-connected arrays of processors |
scientific article; zbMATH DE number 679589 |
Statements
Branch-and-bound and backtrack search on mesh-connected arrays of processors (English)
0 references
14 May 1995
0 references
parallel complexity
0 references
randomized algorithm
0 references