Imagen de Portada

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	S, Rajeshwari, Rajesh, M
Formato:	Preprint
Publicado:	2022
Materias:	Discrete Mathematics 68R01, 68R10
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Shortest Paths in a Weighted Simplicial Complex
por: Chakraborty, Sukrit, et al.
Publicado: (2025)

On solving basic equations over the semiring of functional digraphs
por: Dennunzio, Alberto, et al.
Publicado: (2024)

Transit Functions and Clustering Systems
por: Changat, Manoj, et al.
Publicado: (2024)

Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)

De Bruijn Sequences with Minimum Discrepancy
por: Álvarez, Nicolás, et al.
Publicado: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
por: Araújo, Júlio, et al.
Publicado: (2026)

Note on Min-k-Planar Drawings of Graphs
por: Hliněný, Petr, et al.
Publicado: (2024)

Stack and Queue Numbers of Graphs Revisited
por: Hliněný, Petr, et al.
Publicado: (2023)

Hereditary Graph Product Structure and $\cal H$-clique-width
por: Hliněný, Petr, et al.
Publicado: (2024)

Grid-drawings of graphs in three-dimensions
por: Balogh, Jozsef, et al.
Publicado: (2024)

Foundations of block-parallel automata networks
por: Perrot, Kévin, et al.
Publicado: (2025)

Rectangular Duals on the Cylinder and the Torus
por: Biedl, Therese, et al.
Publicado: (2025)

Las funciones booleans y el lema de Bonami
por: González, María José, et al.
Publicado: (2025)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
por: Hliněný, Petr, et al.
Publicado: (2024)

Learning to Remove Cuts in Integer Linear Programming
por: Puigdemont, Pol, et al.
Publicado: (2024)

Constructions, bounds, and algorithms for peaceable queens
por: Clinch, Katie, et al.
Publicado: (2024)

Ordinals and recursively defined functions on the reals
por: Nivasch, Gabriel, et al.
Publicado: (2023)

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
por: Hliněný, Petr
Publicado: (2023)

KKL theorem for the influence of a set of variables
por: Przybyłowski, Tomasz
Publicado: (2024)

Dispersion on the Complete Graph
por: De Ambroggio, Umberto, et al.
Publicado: (2023)

A framework for distributed discrete evacuation strategies
por: Borowiecki, Piotr, et al.
Publicado: (2025)

Word-Representability of Graphs with respect to Split Recomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

An efficient algorithm for generating transmission irregular trees
por: Stošić, Ivan, et al.
Publicado: (2025)

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

Tight bounds on adjacency labels for monotone graph classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Circularity and repetitiveness in non-injective DF0L systems
por: Goulet-Ouellet, Herman, et al.
Publicado: (2025)

Euclidean Affine Functions and Applications to Calendar Algorithms
por: Neri, Cassio, et al.
Publicado: (2021)

Searching by Heterogeneous Agents
por: Dereniowski, Dariusz, et al.
Publicado: (2021)

A Note on Small Percolating Sets on Hypercubes via Generative AI
por: Bérczi, Gergely, et al.
Publicado: (2024)

Improved bounds for acyclic coloring parameters
por: Kirousis, Lefteris, et al.
Publicado: (2022)

Extremal Results on Conflict-free Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2023)

Symmetric properties and two variants of shuffle-cubes
por: Lü, Huazhong, et al.
Publicado: (2021)

Fast winning strategies for the attacker in eternal domination
por: Bagan, Guillaume, et al.
Publicado: (2024)

Paired many-to-many 2-disjoint path cover of Johnson graphs
por: Liu, Jinhao, et al.
Publicado: (2025)

Degree Realization by Bipartite Multigraphs
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

The damage number of the Cartesian product of graphs
por: Huggan, Melissa A., et al.
Publicado: (2023)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
por: Mehiri, El-Mehdi
Publicado: (2025)

Recovery of cyclic words by their subwords
por: Luchinin, Sergey, et al.
Publicado: (2024)

Palindromic length of infinite aperiodic words
por: Rukavicka, Josef
Publicado: (2024)