A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
From MaRDI portal
Publication:5140773
Recommendations
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
- A linear algorithm for the maximal planar subgraph problem
- A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- A linear time algorithm for finding maximal planar subgraphs
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- A V log V algorithm for isomorphism of triconnected planar graphs
- A bisection algorithm for grammar-based compression of ordered trees
- An n log n algorithm for determining the congruity of polyhedra
- Fast detection and display of symmetry in outerplanar graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Lexicographically least circular substrings
- Maximum common induced subgraph parameterized by vertex cover
- On maximum common subgraph problems in series-parallel graphs
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the complexity of submap isomorphism and maximum common submap problems
- On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree
- Optimal algorithms for computing the canonical form of a circular string
This page was built for publication: A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140773)
