Pages that link to "Item:Q439930"
From MaRDI portal
The following pages link to Faster algorithms for finding and counting subgraphs (Q439930):
Displayed 17 items.
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Algebraic methods in the congested clique (Q2010605) (← 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)
- 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)