Fast algorithms for maximal clique enumeration with limited memory
Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has numerous important applications. Though extensively studied, most existing algorithms become impractical when the input graph is too large and is disk-resident. We first propose an efficient partition-based algorithm...
| Auteurs principaux: | , , , |
|---|---|
| Autres auteurs: | |
| Format: | Conference Paper |
| Langue: | English |
| Publié: |
2013
|
| Accès en ligne: | https://hdl.handle.net/10356/98958 http://hdl.handle.net/10220/12578 |