Back to Search
Start Over
On the minimum edge cover and vertex partition by quasi-cliques problems
- Source :
- [Research Report] RR-8255, INRIA. 2013
- Publication Year :
- 2013
- Publisher :
- HAL CCSD, 2013.
-
Abstract
- A $\gamma$-quasi-clique in a simple undirected graph is a set of vertices which induces a subgraph with the edge density of at least $\gamma$ for $0
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- [Research Report] RR-8255, INRIA. 2013
- Accession number :
- edsair.dedup.wf.001..ae4d3125392c991fe1470b815a8f20a9