Pages that link to "Item:Q1018101"
From MaRDI portal
The following pages link to Approximate labelled subtree homeomorphism (Q1018101):
Displaying 6 items.
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Homeomorphic alignment of weighted trees (Q975210) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Partial information network queries (Q2018546) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
