Pages that link to "Item:Q2043376"
From MaRDI portal
The following pages link to Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376):
Displaying 6 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (Q2867087) (← links)
- Finding cliques in social networks: a new distribution-free model (Q5002730) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)