Pages that link to "Item:Q439930"

The following pages link to Faster algorithms for finding and counting subgraphs (Q439930):

Displaying 31 items.

• Finding and counting small induced subgraphs efficiently (Q294749) (← links)
• Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
• Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
• Finding even subgraphs even faster (Q1671994) (← links)
• Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
• Efficient algorithms for subgraph listing (Q1736617) (← links)
• Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
• Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
• Improved parameterized algorithms for network query problems (Q2414861) (← links)
• Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
• A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
• Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
• Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (Q2965515) (← links)
• Planar Subgraph Isomorphism Revisited (Q3113755) (← links)
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (Q4842123) (← links)
• Recognizing small subgraphs (Q4861348) (← links)
• Homomorphisms are a good basis for counting small subgraphs (Q4977973) (← links)
• On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
• (Q5090377) (← links)
• (Q5090953) (← links)
• (Q5091007) (← links)
• Counting Answers to Existential Questions (Q5091275) (← links)
• Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
• Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Faster Subgraph Counting in Sparse Graphs (Q5875538) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q5875558) (← links)
• Counting subgraphs via homomorphisms (Q5891745) (← links)