Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
PODS
/
Paper
The complexity of mining maximal frequent subgraphs.
Benny Kimelfeld
,
Phokion G. Kolaitis
Venue
A*
PODS
Year
2013
Proceedings
PODS
DBLP record
conf/pods/KimelfeldK13 ↗
Browse the full
PODS paper archive
.