Pages that link to "Item:Q5902149"
From MaRDI portal
The following pages link to Counting Subgraphs via Homomorphisms (Q5902149):
Displaying 11 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← 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)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- (Q5743447) (← links)
- Classes of graphs embeddable in order-dependent surfaces (Q5886263) (← links)