Pages that link to "Item:Q1823708"
From MaRDI portal
The following pages link to Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708):
Displaying 20 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 subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Learning block-preserving graph patterns and its application to data mining (Q1959502) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← 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)
- (Q5090495) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns (Q5452096) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
