Pages that link to "Item:Q5891745"
From MaRDI portal
The following pages link to Counting subgraphs via homomorphisms (Q5891745):
Displaying 18 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Counting subgraphs in hyperbolic graphs with symmetry (Q500096) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752) (← links)
- Handle bases and bounds on the number of subgraphs (Q1087883) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Multiplicities of subgraphs (Q1912755) (← 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 counting homomorphisms to directed acyclic graphs (Q3546354) (← links)
- Homomorphisms are a good basis for counting small subgraphs (Q4977973) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- (Q5091007) (← links)
- Counting Subgraphs via Homomorphisms (Q5902149) (← links)
- Small but unwieldy: a lower bound on adjacency labels for small classes (Q6631355) (← links)