Hypercube embedding heuristics: An evaluation (Q916339): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Trade-offs in Graph Embeddings, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed hypercube embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Trees in a Hypercube is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs on message-passing machines by pairwise mincut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster partitioning approaches to mapping parallel programs onto a hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping strategies in message-based multiprocessor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing a graph for n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Embeddings of Trees in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cubical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank

Revision as of 08:49, 21 June 2024

scientific article
Language Label Description Also known as
English
Hypercube embedding heuristics: An evaluation
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references