Algebraic Operations on PQ Trees and Modular Decomposition Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/11604686_37
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Breakpoint Distance and PQ-trees

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2020English

On Closed Modular Colorings of Rooted Trees

Involve, a Journal of Mathematics
2013English

Efficient Bulk Operations on Dynamic R-Trees

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Pitfalls of Using PQ-trees in Automatic Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Simulating Probabilistic by Deterministic Algebraic Computation Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1985English

Competitive Online Search Trees on Trees

2020English

Optimizing Transformations for Operations on Lists and Trees in the Predicate Programming System

System Informatics
2017English

Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1997English

Quartet Decomposition Server: A Platform for Analyzing Phylogenetic Trees

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy