16 search results - page 4 / 4 » Generalized Watchman Route Problem with Discrete View Cost |
168
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...