scientific article; zbMATH DE number 2080275
From MaRDI portal
Publication:4472526
zbMath1044.68704MaRDI QIDQ4472526
Guo-Hui Lin, Tao Jiang, Paul E. Kearney
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690539.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
phylogenycomputational biologyefficient algorithmmaximal cliquecritical cliqueGraph powergraph roottree powertree root
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Structure and linear time recognition of 3-leaf powers ⋮ On pairwise compatibility graphs having Dilworth number two ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Computing phylogenetic roots with bounded degrees and errors is NP-complete ⋮ Strictly chordal graphs are leaf powers ⋮ New results on pairwise compatibility graphs ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Obtaining split graphs by edge contraction ⋮ A \(2k\) kernel for the cluster editing problem ⋮ The 3-Steiner Root Problem ⋮ Approximation algorithms for bounded degree phylogenetic roots ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Fixed-parameter enumerability of cluster editing and related problems ⋮ Linear time construction of 5-phylogenetic roots for tree chordal graphs ⋮ Exact leaf powers ⋮ Characterizing star-PCGs ⋮ Non-inclusion and other subclasses of chordal graphs ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ A more effective linear kernelization for cluster editing ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Pairwise compatibility graphs ⋮ The complete inclusion structure of leaf power classes ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers ⋮ A survey on pairwise compatibility graphs
