Pages that link to "Item:Q5054759"

The following pages link to Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759):

Displayed 7 items.

• Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) ‎ (← links)
• Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) ‎ (← links)
• On maximum common subgraph problems in series-parallel graphs (Q1678090) ‎ (← links)
• Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) ‎ (← links)
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) ‎ (← links)
• Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) ‎ (← links)
• Maximum tree-packing in time O(n5/2) (Q6085700) ‎ (← links)