A Compact Data Structure and Parallel Algorithms for Permutation Graphs
نویسندگان
چکیده
Jens Gustedt, Michel Morvan, Laurent Viennot. A compact data structure and parallel algorithms for permutation graphs. M. Nagl. 21st Workshop on Graph-Theoretic Concepts in computer Science (WG), 1995, Aachen, Germany. Springer Berlin / Heidelberg, 1017, pp.372380, 1995, Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science. . <10.1007/3-540-606181>.
منابع مشابه
On the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملFully dynamic algorithm for modular decomposition and recognition of permutation graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملOn Improved Time Bounds for Permutation Graph Problems
On improved time bounds for permutation graph problems p. 1 A simple test for interval graphs p. 11 Tolerance graphs and orders p. 17 Scheduling and Related Problems On scheduling problems restricted to interval orders p. 27 Scheduling with incompatible jobs p. 37 Generalized coloring for tree-like graphs p. 50 Parallel and Distributed Algorithms I Optimal (parallel) algorithms for the all-to-a...
متن کامل