Pages that link to "Item:Q439930"
From MaRDI portal
The following pages link to Faster algorithms for finding and counting subgraphs (Q439930):
Displayed 6 items.
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- Detecting and Counting Small Pattern Graphs (Q5502097) (← links)