|
Zapiski Nauchnykh Seminarov LOMI, 1988, Volume 174, Pages 101–121
(Mi znsl4513)
|
|
|
|
Testing planar pictures isomorphism within linear time
A. N. Grigor'eva
Abstract:
Planar picture is defined as an embedding of a planar graph into the plane. Two pictures are isomorphic iff there exists an isotopy of the plane mapping one picture onto another. A linear-time algorithm for testing planar pictures isomorphism is designed. For 3-connected pictures the algorithm from [6] is involved.
Citation:
A. N. Grigor'eva, “Testing planar pictures isomorphism within linear time”, Computational complexity theory. Part 3, Zap. Nauchn. Sem. LOMI, 174, "Nauka", Leningrad. Otdel., Leningrad, 1988, 101–121; J. Soviet Math., 55:2 (1991), 1588–1602
Linking options:
https://www.mathnet.ru/eng/znsl4513 https://www.mathnet.ru/eng/znsl/v174/p101
|
|