17 citations · 28 across the 4 of their papers we have counts for
4 papers
TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets
Hadi Poormohammadi, Changiz Eslahchi, Ruzbeh Tusserkani
The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripN…
TripNet: A Method for Constructing Phylogenetic Networks from Triplets
Ruzbeh Tusserkani, Changiz Eslahchi, Hadi Poormohammadi +1
We present TripNet, a method for constructing phylogenetic networks from triplets. We will present the motivations behind our approach and its theoretical and empirical justificati…
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3
This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…
On the Complexity of the Circular Chromatic Number
Hamed Hatami, Ruzbeh Tusserkani
Circular chromatic number, is a natural generalization of chromatic number. It is known that it is \NP-hard to determine whether or not an arbitrary graph satisfies $χ(G)…