Parallel realization of permutations over trees

DOI10.1016/0012-365X(82)90143-1zbMath0483.05026OpenAlexW2084168652MaRDI QIDQ1163027

Maurice Tchuente

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90143-1

zbMATH Keywords

compatible permutation

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)

Related Items (6)

Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms ⋮ On expansive and anti-expansive tree maps ⋮ Generating all linear transformations ⋮ ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK ⋮ Complete simulation of automata networks ⋮ Permutation Factorization on Star-Connected Networks of Binary Automata

Cites Work

• Parallel calculation of a linear mapping on a computer network
• On maximal paths and circuits of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel realization of permutations over trees