Pages that link to "Item:Q1056237"
From MaRDI portal
The following pages link to The subgraph isomorphism problem for outerplanar graphs (Q1056237):
Displaying 21 items.
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- 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 subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← 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)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Families of nested graphs with compatible symmetric-group actions (Q2335508) (← links)
- Finding Largest Common Substructures of Molecules in Quadratic Time (Q2971143) (← 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)
- Anti-unification in Constraint Logic Programming (Q5108501) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
