Pages that link to "Item:Q4327818"
From MaRDI portal
The following pages link to The Parallel Complexity of Tree Embedding Problems (Q4327818):
Displaying 9 items.
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- (Q3034818) (← links)
- (Q3334090) (← links)
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES (Q4020276) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT (Q5249050) (← links)
- Notes on the Distributed Computation of Merge Trees on CW-Complexes (Q5359524) (← links)
- Finding smallest supertrees (Q6487952) (← links)