scientific article; zbMATH DE number 1820633
From MaRDI portal
Publication:4779780
zbMath1007.05001MaRDI QIDQ4779780
Publication date: 27 October 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Geometric partitioning and robust ad-hoc network design, Approximating tree edit distance through string edit distance, Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading, Tree structure for contractible regions in \(\mathbb R^{3}\), Tai mapping hierarchy for rooted labeled trees through common subforest, Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, Solving subgraph isomorphism problems with constraint programming, On the Power of Color Refinement, On the hardness of computing the edit distance of shallow trees, An inductive characterization of matching in binding bigraphs, Guarding a set of line segments in the plane, Mining frequent closed rooted trees, Comparing similar ordered trees in linear-time, Largest Weight Common Subtree Embeddings with Distance Penalties, m-Potent Elements in Order-Preserving Transformation Semigroups and Ordered Trees, Enumeration of viral capsid assembly pathways: tree orbits under permutation group action, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, Finding multi-objective supported efficient spanning trees, An algebraic view of the relation between largest common subtrees and smallest common supertrees, Learning grammars for architecture-specific facade parsing, ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS, Counting Weighted Independent Sets beyond the Permanent, Constrained tree inclusion, Decomposition algorithms for the tree edit distance problem, Matching of Bigraphs, On the complexity of finding a largest common subtree of bounded degree, Determining the Hausdorff Distance Between Trees in Polynomial Time, Isomorphic unordered labeled trees up to substitution ciphering
Uses Software
