scientific article; zbMATH DE number 1820633
From MaRDI portal
Recommendations
Cited in
(36)- A note on trees, tables, and algorithms
- Approximating tree edit distance through string edit distance
- Geometric partitioning and robust ad-hoc network design
- Enumeration of viral capsid assembly pathways: tree orbits under permutation group action
- Comparing similar ordered trees in linear-time
- Algorithms on Subtree Filament Graphs
- \(m\)-potent elements in order-preserving transformation semigroups and ordered trees.
- Isomorphic unordered labeled trees up to substitution ciphering
- The Bourque distances for mutation trees of cancers
- Guarding a set of line segments in the plane
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- An inductive characterization of matching in binding bigraphs
- Largest Weight Common Subtree Embeddings with Distance Penalties
- Polynomial-delay generation of functional digraphs up to isomorphism
- Solving subgraph isomorphism problems with constraint programming
- scientific article; zbMATH DE number 1516798 (Why is no real title available?)
- Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Decomposition algorithms for the tree edit distance problem
- Algorithms on Trees and Graphs
- On the complexity of finding a largest common subtree of bounded degree
- Finding multi-objective supported efficient spanning trees
- On the power of color refinement
- Learning grammars for architecture-specific facade parsing
- Tai mapping hierarchy for rooted labeled trees through common subforest
- Tree structure for contractible regions in \(\mathbb R^{3}\)
- ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS
- Counting weighted independent sets beyond the permanent
- Determining the Hausdorff distance between trees in polynomial time
- Mining frequent closed rooted trees
- On the hardness of computing the edit distance of shallow trees
- Matching of bigraphs
- Constrained tree inclusion
- A guide to graph algorithms
- Learning driven three-phase search for the maximum independent union of cliques problem
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 Q4779780)
