✦ LIBER ✦

Complexity of “wild” matrix problems and of isomorphism of algebras and graphs

✍ Scribed by D. Yu. Grigor'ev

Publisher: Springer US
Year: 1983
Tongue: English
Weight: 425 KB
Volume: 22
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01084390

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Projectivity and isomorphism of strictly

Projectivity and isomorphism of strictly simple algebras

✍ K. A. Kearnes; Á. Szendrei 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 186 KB

Matrix equivalence and isomorphism of mo

Matrix equivalence and isomorphism of modules

✍ Robert M. Guralnick 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 746 KB

Isomorphisms and automorphisms of graph

Isomorphisms and automorphisms of graph coverings

✍ M. Hofmeister 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Lattice isomorphisms of Lie algebras and

Lattice isomorphisms of Lie algebras and algebraic groups

✍ Helmut Völklein 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

On the cycle-isomorphism of graphs

✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor

On testing isomorphism of permutation gr

On testing isomorphism of permutation graphs

✍ Charles J. Colbourn 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 530 KB

## Abstract A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2‐dimensional partial orders) is described. It operates by performing two types of simplifying transformations on the graph; the contraction of duplicate vertices and the contraction of un