Pages that link to "Item:Q1578418"

The following pages link to Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418):

Displaying 10 items.

• The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
• Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
• A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
• Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
• An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
• (Q5090495) (← links)
• Fast parallel reordering and isomorphism testing of \(k\)-trees (Q5956832) (← links)
• Finding \(k\)-secluded trees faster (Q6039423) (← links)