Skip to main navigation
Skip to search
Skip to main content
Maastricht University Home
Support & FAQ
Home
Researchers
Publications
Activities
Press/Media
Prizes
Organisations
Dataset/Software
Projects
Search by expertise, name or affiliation
Agreement forests of caterpillar trees: Complexity, kernelization and branching
S. Kelk
*
,
R. Meuwese
*
Corresponding author for this work
Department of Advanced Computing Sciences
Department of Advanced Computing Sciences
MCM | Faculty of Science and Engineering
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Agreement forests of caterpillar trees: Complexity, kernelization and branching'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Kernelization
100%
Agreement Forest
100%
Tree Complexity
100%
Caterpillar Tree
100%
Tree Branching
100%
Phylogenetic Tree
60%
Caterpillar
60%
NP-hard
40%
General Tree
40%
Tight
20%
Non-overlapping
20%
Ways of Understanding
20%
Homeomorphic
20%
Reduction Rules
20%
Minimum Size
20%
Binary Tree
20%
APX-hardness
20%
Number of Blocks
20%
K-blocks
20%
Two-tree
20%
INIS
branching ratio
100%
forests
100%
comparative evaluations
60%
yields
40%
size
40%
reduction
20%
polynomials
20%
kernels
20%
partition
20%
Mathematics
Polynomial
100%
Kernelization
100%
Binary Tree
100%
Computer Science
Subclasses
100%
Binary Tree
100%
Immunology and Microbiology
Phylogenetic Tree
100%