Pages that link to "Item:Q1578418"
From MaRDI portal
The following pages link to Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418):
Displaying 5 items.
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← 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)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- (Q5090495) (← links)
