Optimal Assignments of Numbers to Vertices

Cited in

(only showing first 100 items - show all)

On randomized broadcasting in star graphs
The profile of the Cartesian product of graphs
Bounds on isoperimetric values of trees
Spanning tree congestion of the hypercube
Data encodings and their costs
The global theory of paths in networks. I: Definitions, examples and limits
Edge-isoperimetric inequalities in the grid
Contributions to the geometry of Hamming spaces
The cyclic cutwidth of trees
On an equivalence in discrete extremal problems
A finite-dimensional normed space with two non-equivalent symmetric bases
Matchings and paths in the cube
On \(k\)-ary \(n\)-cubes: Theory and applications.
The edge-isoperimetric problem on the 600-vertex regular solid
Recursive circulants and their embeddings among hypercubes
A new lower bound for the bipartite crossing number with applications
Alternative evaluation functions for the cyclic bandwidth sum problem
The \(S\)-\textsc{labeling} problem: an algorithmic tour
Improved exact approaches for row layout problems with departments of equal length
New relationships for multi-neighborhood search for the minimum linear arrangement problem
A stability result for the cube edge isoperimetric inequality
Chvátal's conjecture and correlation inequalities
New infinite family of regular edge-isoperimetric graphs
On a biased edge isoperimetric inequality for the discrete cube
Eigenvalues of subgraphs of the cube
An isoperimetric inequality for antipodal subsets of the discrete cube
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
Linear time construction of a compressed Gray code
The bandwidth sum of join and composition of graphs
On the area of hypercube layouts.
Edge-isoperimetric problems for Cartesian powers of regular graphs
Generating lower bounds for the linear arrangement problem
Edge isoperimetric theorems for integer point arrays
On bandwidth and edgesum for the composition of two graphs
On bandwidth sums of graphs
Lower bounds for the quadratic assignment problem via triangle decompositions
A branch-and-bound algorithm for the minimum cut linear arrangement problem
The single row facility layout problem: state of the art
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
Bandwidth sums of block graphs and cacti
Characterization of the congestion lemma on layout computation
Embedding algorithm of spined cube into grid structure and its wirelength computation
Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches
The distance orientation problem
Expansion in supercritical random subgraphs of the hypercube and its consequences
Log-Sobolev inequality for the multislice, with applications
Edge isoperimetric inequalities for powers of the hypercube
Norms of randomized circulant matrices
Minimum degree conditions for the strength and bandwidth of graphs
Demand-aware network designs of bounded degree
Decorous combinatorial lower bounds for row layout problems
Preface: CALDAM 2017
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
The inverse Banzhaf problem
Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
Node set optimization problem for complete Josephus cubes
Vertex-isoperimetric stability in the hypercube
On density of subgraphs of halved cubes
Conjectures on wirelength of hypercube into cylinder and torus
Shadows of ordered graphs
Morphisms for resistive electrical networks
Long paths and cycles in subgraphs of the cube
Long geodesics in subgraphs of the cube
An improved simulated annealing algorithm for bandwidth minimization
A study on cyclic bandwidth sum
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
The carvingwidth of hypercubes
Minimum linear arrangement of chord graphs
The optimal number of faces in cubical complexes
The filling problem in the cube
An isoperimetric inequality for conjugation-invariant sets in the symmetric group
Lower bounds for the bandwidth problem
Compact representation of graphs with bounded bandwidth or treedepth
Optimal embedding of hypercube into cylinder
A rigorous proof on circular wirelength for hypercubes
Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
SDP relaxations for some combinatorial optimization problems
Increasing paths in edge-ordered graphs: the hypercube and random graph
Lower bounds for the minimum linear arrangement of a graph
Optimal embedding of locally twisted cubes into grids
Strong contraction and influences in tail spaces
Almost isoperimetric subsets of the discrete cube
The Fourier entropy-influence conjecture for certain classes of Boolean functions
On Kruskal's cascades and counting containments in a set of subsets
Tabu search for the cyclic bandwidth problem
Edge Addition Number of Cartesian Product of Paths and Cycles
Minimum Linear Arrangement of Series-Parallel Graphs
Edge-isoperimetric problem for Cayley graphs and generalized Takagi functions
Quantum query complexity of almost all functions with fixed on-set size
A New Lower Bound for the Minimum Linear Arrangement of a Graph
Isoperimetric Problem and Meta-fibonacci Sequences
Semidefinite relaxations of ordering problems
Storage representations for tree-like data structures
On the number of hypercubic bipartitions of an integer
Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
An approximate vertex-isoperimetric inequality for r-sets
Summarizing transactional databases with overlapped hyperrectangles
Bounds on the costs of data encodings
Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry

This page was built for publication: Optimal Assignments of Numbers to Vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5627967)