Abstract The Balanced Minimum Evolution Problem (BMEP) is an APX-hard network design
problem that consists of finding a minimum length unrooted binary tree (also called a …

This article surveys results on maximal k-degenerate graphs, k-trees, and related classes
including simple k-trees, k-paths, maximal outerplanar graphs, and Apollonian networks …

The Robinson-Foulds (RF) distance, one of the most widely used metrics for comparing
phylogenetic trees, has the advantage of being intuitive, with a natural interpretation in terms …

In this paper, a technique of coding a message is presented using the super mean labeling
on a two star graph K 1, m∪ K 1, n, m≤ n. A method of fixing the super mean labeling on …

Tree identification is the problem of determining whether two trees are isomorphic, and it is a
fundamental problem with a variety of interesting applications in diverse scientific and …

Many human diseases, including viral infections and cancers, are driven by the evolutionary
dynamics of heterogeneous populations of genomic variants. A major type of evolutionary …

Abstract Motivation The Balanced Minimum Evolution (BME) is a powerful distance based
phylogenetic estimation model introduced by Desper and Gascuel and nowadays …

Recent advances on the polyhedral combinatorics of the Balanced Minimum Evolution
Problem (BMEP) enabled the identification of fundamental characteristics of the convex hull …

Let $\mathcal {G} $ be the set of all the planar embeddings of a (not necessarily connected)
$ n $-vertex graph $ G $. We present a bijection $\Phi $ from $\mathcal {G} $ to the natural …

This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree.
The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures …