scientific article; zbMATH DE number 7286736
From MaRDI portal
Publication:5140773
DOI10.4230/LIPIcs.CPM.2018.10zbMath1497.68361MaRDI QIDQ5140773
Colin de la Higuera, Takeyuki Tamura, Tatsuya Akutsu
Publication date: 16 December 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- A bisection algorithm for grammar-based compression of ordered trees
- An n log n algorithm for determining the congruity of polyhedra
- Lexicographically least circular substrings
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Optimal algorithms for computing the canonical form of a circular string
- Fast detection and display of symmetry in outerplanar 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 maximum common subgraph problems in series-parallel graphs
- Tree compression using string grammars
- A V log V algorithm for isomorphism of triconnected planar graphs
- Maximum common induced subgraph parameterized by vertex cover
- On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
- Graph isomorphism in quasipolynomial time [extended abstract]
This page was built for publication:
