The following pages link to (Q4779780):
Displayed 28 items.
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading (Q323425) (← links)
- Enumeration of viral capsid assembly pathways: tree orbits under permutation group action (Q542011) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Comparing similar ordered trees in linear-time (Q925064) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Learning grammars for architecture-specific facade parsing (Q1800054) (← links)
- An inductive characterization of matching in binding bigraphs (Q1941899) (← links)
- Mining frequent closed rooted trees (Q1959538) (← links)
- Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
- Isomorphic unordered labeled trees up to substitution ciphering (Q2115877) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- Decomposition algorithms for the tree edit distance problem (Q2569420) (← links)
- Tree structure for contractible regions in \(\mathbb R^{3}\) (Q2642730) (← links)
- Matching of Bigraphs (Q2867883) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS (Q3391403) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
- Determining the Hausdorff Distance Between Trees in Polynomial Time (Q5024666) (← links)
- <i>m</i>-Potent Elements in Order-Preserving Transformation Semigroups and Ordered Trees (Q5409787) (← links)
- On the hardness of computing the edit distance of shallow trees (Q6111592) (← links)