Pages that link to "Item:Q1056237"
From MaRDI portal
The following pages link to The subgraph isomorphism problem for outerplanar graphs (Q1056237):
Displayed 7 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)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)