The following pages link to (Q3334090):
Displaying 12 items.
- The three-in-a-tree problem (Q653792) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- The Parallel Complexity of Tree Embedding Problems (Q4327818) (← links)
- Mineurs d'arbres avec racines (Q4858839) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- Regular-factors in the complements of partial k-trees (Q5057452) (← links)
- Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153) (← links)
