An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for the characterization of the nonplanarity of a maximal graphical partition |
scientific article; zbMATH DE number 4027494
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the characterization of the nonplanarity of a maximal graphical partition |
scientific article; zbMATH DE number 4027494 |
Statements
An algorithm for the characterization of the nonplanarity of a maximal graphical partition (English)
0 references
1986
0 references
The authors prove an algorithm which has the capability of testing the planarity of Euler maximal sequences (e.m.s.) satisfying some suitable connectivity or adjacency constraints. The algorithm is based upon a generalization of a canonical method of reduction of the adjacency matrices. The numerical experiences performed have shown that this algorithm is efficient to characterize non planar e.m.s.
0 references
algorithm
0 references
testing
0 references
planarity
0 references
Euler maximal sequences
0 references
