Pages that link to "Item:Q2965515"

The following pages link to Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (Q2965515):

Displaying 23 items.

• Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
• Rural postman parameterized by the number of components of required edges (Q314816) (← links)
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
• A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
• Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
• A tight lower bound for planar Steiner orientation (Q1999967) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
• Envy-free allocations respecting social networks (Q2124438) (← links)
• A multiparametric view on answer set programming (Q2317973) (← links)
• Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
• Mine ’Em All: A Note on Mining All Graphs (Q2827475) (← links)
• On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
• A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
• (Q5088957) (← links)
• (Q5089171) (← links)
• (Q5090495) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
• Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
• (Q5874480) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q5875558) (← links)
• Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
• Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)