On some similarity of finite sets (and what we can say today about certain old problem)

DOI10.1016/j.ins.2021.12.117OpenAlexW4206308628MaRDI QIDQ6199497

Zbigniew Pliszka

Publication date: 28 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.12.117

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• On the k-ary hypercube
• A survey of the theory of hypercube graphs
• Embedding all binary trees in the hypercube
• Wirelength of hypercubes into certain trees
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Embedding of hypercubes into sibling trees
• Efficient Embeddings of Trees in Hypercubes
• Probabilistic analysis of the number partitioning problem
• Phase Transition in the Number Partitioning Problem
• On the History of the Minimum Spanning Tree Problem
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Reducibility among Combinatorial Problems
• Balanced binary trees for ID management and load balance in distributed hash tables
• What Do Trees and Hypercubes Have in Common?

This page was built for publication: On some similarity of finite sets (and what we can say today about certain old problem)