scientific article; zbMATH DE number 3575612
From MaRDI portal
Publication:4148000
Cited in
(99)- Graph matching using the interference of continuous-time quantum walks
- A parametric filtering algorithm for the graph isomorphism problem
- Computational properties of argument systems satisfying graph-theoretic constraints
- Graph isomorphism problem
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Strong tree-cographs are Birkhoff graphs
- Complement reducible graphs
- A note on compact graphs
- Testing planar pictures for isomorphism in linear time
- A linear-time algorithm for isomorphism of a subclass of chordal graphs
- Canonical representations of partial 2- and 3-trees
- A remark on the time complexity of the subtree problem
- On the coding of ordered graphs
- Geometric classification of triangulations and their enumeration in a convex polygon
- A term equality problem equivalent to graph isomorphism
- Efficient generation of triconnected plane triangulations.
- On the isomorphism of expressions
- Correspondence and translation for heterogeneous data
- The QAP-polytope and the graph isomorphism problem
- A long trip in the charming world of graphs for pattern recognition
- On the complexity of submap isomorphism and maximum common submap problems
- Efficient subgraph matching using topological node feature constraints
- Approximation of graph edit distance based on Hausdorff matching
- Network alignment by discrete Ollivier-Ricci flow
- VF2++ -- an improved subgraph isomorphism algorithm
- Fast minor testing in planar graphs
- Subcomplete generalizations of graph isomorphism
- An algebra for pomsets.
- Graph recurrence
- Isomorphism of chordal (6, 3) graphs
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- Learning block-preserving graph patterns and its application to data mining
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Graph isomorphism and identification matrices: Sequential algorithms
- Isomorphism testing for \(T\)-graphs in FPT
- The complexity of the Hajós calculus for planar graphs
- On algorithms that effectively distinguish gradient-like dynamics on surfaces
- New invariants for the graph isomorphism problem
- Computing the flip distance between triangulations
- Deciding the isomorphism problem in classes of unary automatic structures
- The graph isomorphism problem and approximate categories
- The graph matching problem
- Graphs whose complement and square are isomorphic
- Finding a forest in a tree
- Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- Recursive Generation of 5-Regular Planar Graphs
- Efficient Suboptimal Graph Isomorphism
- scientific article; zbMATH DE number 3585658 (Why is no real title available?)
- The simultaneous conjugacy problem in groups of piecewise linear functions.
- Counting and sampling minimum cuts in genus g graphs
- Recognizing generalized Sierpiński graphs
- Isomorphisms of maps on the sphere
- Decremental SPQR-trees for Planar Graphs
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
- Canonical representations of partial 2-and 3-trees
- scientific article; zbMATH DE number 7559375 (Why is no real title available?)
- Algorithmic data science (invited talk)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- Enumerating grid layouts of graphs
- On topological classification of Morse-Smale diffeomorphisms on the sphere \(S^n\) \((n>3)\)
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
- Global minimum cuts in surface embedded graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- Computational complexity of computing symmetries in finite-domain planning
- Minimum Cuts in Surface Graphs
- Graph isomorphism restricted by lists
- Topological recognition of polyhedral objects from multiple views
- Distributed Testing of Graph Isomorphism in the CONGEST Model.
- Family Trees for Enumeration
- Bicolor Graph of Morse-Smale Cascades on Manifolds of Dimension Three
- Grid recognition: classical and parameterized computational perspectives
- Uniquely colorable graphs up to automorphisms
- Directed path graph isomorphism
- On the complexity of matroid isomorphism problem
- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete
- Topological conjugacy of gradient-like flows on surfaces and efficient algorithms for its distinction
- \((t, s)\)-completely independent spanning trees
- Roots in the semiring of finite deterministic dynamical systems
- Critically fixed Thurston maps: classification, recognition, and twisting
- Weakly leveled planarity with bounded span
- Solving ``pseudo-injective polynomial equations over finite dynamical systems
- Graph isomorphism and multivariate graph spectrum
- The flip graph on planar layouts of a planar tanglegram is almost a hypercube
- Injectivity of polynomials over finite discrete dynamical systems
- Weakly leveled planarity with bounded span
- Multiplicative residue semigroups with planar Cayley graphs
- Rethinking graph classification problem in presence of isomorphism
- Automorphisms and isomorphisms of maps in linear time
- Complexity classes of equivalence problems revisited
- Automorphisms and isomorphisms of maps in linear time
- An n log n algorithm for determining the congruity of polyhedra
- Linear time tree codes
- Functional graphs of polynomials over finite fields
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
- Isomorphism testing of k-trees is in NC, for fixed k
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4148000)
