An optimal permutation routing algorithm on full-duplex hexagonal networks

An optimal permutation routing algorithm on full-duplex hexagonal networks

Show other versions (1)

Distributed Computing and Networking

Bibliographic Details
Main Authors:	Ignasi Sau, Janez Žerovnik
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/443/pdf

Similar Items

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
by: Rafal Witkowski, et al.
Published: (2013-11-01)

Self-complementing permutations of k-uniform hypergraphs
by: Artur Szymański, et al.
Published: (2009-01-01)

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
by: Guy Louchard, et al.
Published: (2007-01-01)

A new characterization and a recognition algorithm of Lucas cubes
by: Andrej Taranenko
Published: (2013-10-01)

The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
by: Guy Louchard, et al.
Published: (2012-09-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
by: Akos Seress, et al.
Published: (2010-03-01)

Permutations Containing and Avoiding $\textit{123}$ and $\textit{132}$ Patterns
by: Aaron Robertson
Published: (1999-01-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

Shifts with decidable language and non-computable entropy
by: Peter Hertling, et al.
Published: (2008-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

On symmetric structures of order two
by: Michel Bousquet, et al.
Published: (2008-01-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Multidimensional cellular automata and generalization of Fekete's lemma
by: Silvio Capobianco
Published: (2008-01-01)

Spanning forests on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2008-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Leftmost derivations of propagating scattered context grammars: a new proof
by: Tomáš Masopust, et al.
Published: (2008-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

The Laplacian spread of a tree
by: Yi-Zheng Fan, et al.
Published: (2008-01-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)