On the existence of funneled orientations for classes of rooted phylogenetic networks
From MaRDI portal
Publication:6652436
DOI10.1016/J.TCS.2024.114908MaRDI QIDQ6652436
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- On the orientation of graphs
- Locating a tree in a phylogenetic network
- Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Bipolar orientations revisited
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- NP-completeness of st-orientations for plane graphs
- Properties of normal phylogenetic networks
- Graph balancing: a special case of scheduling unrelated parallel machines
- Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
- Graph Drawing
- Graph-Theoretic Concepts in Computer Science
- Orienting undirected phylogenetic networks
This page was built for publication: On the existence of funneled orientations for classes of rooted phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652436)