Pages that link to "Item:Q5710812"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710812):
Displaying 5 items.
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Shortest connectivity. An introduction with applications in phylogeny. (Q1762565) (← links)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- Computing and Combinatorics (Q4681207) (← links)
- Algorithms and Computation (Q5897906) (← links)