Pages that link to "Item:Q1842565"
From MaRDI portal
The following pages link to The complexity of computing the Tutte polynomial on transversal matroids (Q1842565):
Displaying 10 items.
- Splitting formulas for Tutte polynomials (Q1362104) (← links)
- Lattice path matroids: Enumerative aspects and Tutte polynomials (Q1417949) (← links)
- Series-parallel posets and the Tutte polynomial (Q1815311) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- (Q5463581) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- Diverse collections in matroids and graphs (Q6201861) (← links)
- The MaxIS-Shapley value in perfect graphs (Q6606181) (← links)
