Pages that link to "Item:Q1692069"

The following pages link to Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069):

Displaying 6 items.

• Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
• Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• Efficient pattern matching on graph patterns of bounded treewidth (Q2840694) (← links)
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees (Q3204040) (← links)
• (Q4263472) (← links)