Pages that link to "Item:Q5627967"
From MaRDI portal
The following pages link to Optimal Assignments of Numbers to Vertices (Q5627967):
Displayed 50 items.
- On edge numberings of the \(n\)-cube graph (Q689968) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Isoperimetric inequalities for faces of the cube and the grid (Q916673) (← links)
- Exact face-isoperimetric inequalities (Q916674) (← links)
- Cleaning a network with brushes (Q930892) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- The profile of the Cartesian product of graphs (Q1005223) (← links)
- Data encodings and their costs (Q1139942) (← links)
- The global theory of paths in networks. I: Definitions, examples and limits (Q1167670) (← links)
- Edge-isoperimetric inequalities in the grid (Q1181010) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- The cyclic cutwidth of trees (Q1270769) (← links)
- On an equivalence in discrete extremal problems (Q1301649) (← links)
- A finite-dimensional normed space with two non-equivalent symmetric bases (Q1335153) (← links)
- Matchings and paths in the cube (Q1363756) (← links)
- On \(k\)-ary \(n\)-cubes: Theory and applications. (Q1399117) (← links)
- The edge-isoperimetric problem on the 600-vertex regular solid (Q1399246) (← links)
- Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- The bandwidth sum of join and composition of graphs (Q1772413) (← links)
- On the area of hypercube layouts. (Q1853103) (← links)
- Edge-isoperimetric problems for Cartesian powers of regular graphs (Q1885043) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- Edge isoperimetric theorems for integer point arrays (Q1893693) (← links)
- On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
- On bandwidth sums of graphs (Q1898897) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- A study on cyclic bandwidth sum (Q2471051) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- The carvingwidth of hypercubes (Q2509307) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- The optimal number of faces in cubical complexes (Q2547206) (← links)
- On Kruskal's cascades and counting containments in a set of subsets (Q3043155) (← links)
- Edge Addition Number of Cartesian Product of Paths and Cycles (Q3439378) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- Isoperimetric Problem and Meta-fibonacci Sequences (Q3511309) (← links)
- Storage representations for tree-like data structures (Q3878744) (← links)
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561) (← links)
- Bounds on the costs of data encodings (Q4188717) (← links)
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- Optimal Numberings of an $N \times N$ Array (Q4726293) (← links)
- Evaluation of Boolean functions on noisy input (Q4732417) (← links)
- Edge-Isoperimetric Inequalities and Influences (Q5443800) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
- Polytopes, graphs, and complexes (Q5612292) (← links)
- Sets of Lattice Points which Contain a Maximal Number of Edges (Q5619110) (← links)