Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs

Authors:
S. Mitchell;T. Beyer;W. Jones
Affiliations:
Department of Computer Science, University of Oregon, Eugene, OR and University of Louisville, Louisville, Kentucky;The Computer Center, University of Oregon, Eugene, OR;Department of Applied Mathematics and Computer Science, University of Louisville, Louisville, KY
Venue:
Journal of the ACM (JACM)
Year:
1979

Citing 4
Cited 8

An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Algorithms on trees and maximal outerplanar graphs: design, complexity analysis, and data structures study.

Algorithms on trees and maximal outerplanar graphs: design, complexity analysis, and data structures study.

An algebraic theory of graph reduction

Journal of the ACM (JACM)
Folding a simple polygon: a paradigm for computational geometry

CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs

Journal of Parallel and Distributed Computing
Subclasses of k-trees: characterization and recognition

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Two new approximation algorithms for the maximum planar subgraph problem

Acta Cybernetica
Subclasses of k-trees: Characterization and recognition

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Sharp bounds for Zagreb indices of maximal outerplanar graphs

Journal of Combinatorial Optimization
Polynomial algorithms for open plane graph and subgraph isomorphisms

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract