Pages that link to "Item:Q3094934"
From MaRDI portal
The following pages link to Sparse Balanced Partitions and the Complexity of Subgraph Problems (Q3094934):
Displaying 6 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- (Q4363919) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs (Q6068941) (← links)