Pages that link to "Item:Q3833624"
From MaRDI portal
The following pages link to An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624):
Displaying 8 items.
- Strings, trees, and patterns (Q1186597) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
- Finding smallest supertrees (Q6487952) (← links)
