scientific article; zbMATH DE number 3575612
From MaRDI portal
zbMath0369.05028MaRDI QIDQ4148000
No author found.
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete, Minimum Cuts in Surface Graphs, A term equality problem equivalent to graph isomorphism, A general backtrack algorithm for the isomorphism problem of combinatorial objects, Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms, The QAP-polytope and the graph isomorphism problem, New invariants for the graph isomorphism problem, Isomorphism of chordal (6, 3) graphs, Canonical representations of partial 2-and 3-trees, Isomorphism testing for \(T\)-graphs in FPT, Unnamed Item, Strong tree-cographs are Birkhoff graphs, Computing the flip distance between triangulations, 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, Family Trees for Enumeration, Functional graphs of polynomials over finite fields, Kernelization and parameterized algorithms for covering a tree by a set of stars or paths, 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, Deciding the isomorphism problem in classes of unary automatic structures, The simultaneous conjugacy problem in groups of piecewise linear functions., Complement reducible graphs, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, Enumerating Grid Layouts of Graphs, Isomorphism testing of k-trees is in NC, for fixed k, On the complexity of matroid isomorphism problem, The graph isomorphism problem and approximate categories, The isomorphism problem for planar 3-connected graphs is in unambiguous logspace, Learning block-preserving graph patterns and its application to data mining, The graph matching problem, Efficient generation of triconnected plane triangulations., Graphs whose complement and square are isomorphic, Orthogonal drawings of graphs for the automation of VLSI circuit design, Unnamed Item, On topological classification of Morse–Smale diffeomorphisms on the sphere S n (n > 3), Counting and sampling minimum cuts in genus \(g\) graphs, Network alignment by discrete Ollivier-Ricci flow, A note on compact graphs, Graph isomorphism and identification matrices: Sequential algorithms, Testing planar pictures for isomorphism in linear time, Decremental SPQR-trees for Planar Graphs, VF2++ -- an improved subgraph isomorphism algorithm, A linear-time algorithm for isomorphism of a subclass of chordal graphs, Canonical representations of partial 2- and 3-trees, Distributed Testing of Graph Isomorphism in the CONGEST Model., Fast minor testing in planar graphs, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Topological recognition of polyhedral objects from multiple views, The complexity of the Hajós calculus for planar graphs, Complexity classes of equivalence problems revisited, Unnamed Item, Unnamed Item, Graph theory (algorithmic, algebraic, and metric problems), Recursive Generation of 5-Regular Planar Graphs, On algorithms that effectively distinguish gradient-like dynamics on surfaces, A remark on the time complexity of the subtree problem, Graph isomorphism restricted by lists, Graph matching using the interference of continuous-time quantum walks, Finding a Forest in a Tree, On the coding of ordered graphs, A parametric filtering algorithm for the graph isomorphism problem, Efficient Suboptimal Graph Isomorphism, The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs, Computational properties of argument systems satisfying graph-theoretic constraints, Recognizing generalized Sierpiński graphs, Unnamed Item, Subcomplete generalizations of graph isomorphism, Isomorphisms of maps on the sphere, On the isomorphism of expressions, Computational Complexity of Computing Symmetries in Finite-Domain Planning, Graph isomorphism problem, An n log n algorithm for determining the congruity of polyhedra, An algebra for pomsets., Unnamed Item, Linear time tree codes, Correspondence and translation for heterogeneous data, Graph recurrence, The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs, Geometric classification of triangulations and their enumeration in a convex polygon
