Pages that link to "Item:Q4706236"

The following pages link to Computing Phylogenetic Roots with Bounded Degrees and Errors (Q4706236):

Displaying 22 items.

• A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
• Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
• Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
• Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
• Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
• Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
• A more effective linear kernelization for cluster editing (Q1006044) (← links)
• Simplicial powers of graphs (Q1040586) (← links)
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
• Cluster graph modification problems (Q1885821) (← links)
• On the threshold of intractability (Q2051847) (← links)
• Clustering with partial information (Q2268879) (← links)
• Linear-time algorithms for tree root problems (Q2346968) (← links)
• Clustering with qualitative information (Q2568462) (← links)
• Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
• Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
• The 3-Steiner Root Problem (Q3508559) (← links)
• Clustering with Partial Information (Q3599122) (← links)
• Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
• Simplicial Powers of Graphs (Q5505654) (← links)
• Characterizing star-PCGs (Q5916258) (← links)