作者: Kazuhisa Makino , Takeaki Uno
DOI: 10.1007/978-3-540-27810-8_23
关键词:
摘要: … sets or all minimal vertex covers) of a given graph and (2) … Hence our algorithms can enumerate all closed item sets in … sparse, it is shown [24] that our algorithms for sparse graphs …