Pages that link to "Item:Q5891745"
From MaRDI portal
The following pages link to Counting Subgraphs via Homomorphisms (Q5891745):
Displaying 9 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- (Q5091007) (← links)