Pages that link to "Item:Q881594"

The following pages link to Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594):

Displaying 9 items.

• Parameterized graph cleaning problems (Q967382) (← links)
• Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← 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)
• Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
• (Q5053191) (← links)
• Parameterized Graph Cleaning Problems (Q5302063) (← links)
• Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
• Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)