NP-hard 그래프 문제를 위한 실용적인 알고리즘 프레임워크
(Framework of Practical Algorithms for NP-hard Graph Problems)

• 애플리케이션
  • Social network 분석 SW - SocialNetworkAnalysis
  • 화합물 검색 SW - CompoundSearch
  • Subgraph 쿼리 프로세싱 SW - SubQP
  • 그래프 유사 분석 SW - ChemSearch
  • PPI 분석 SW - predictPPI
• 알고리즘
  • Subgraph isomorphism - DAF
  • Supergraph search - IDAR
  • Continuous subgraph matching - SymBi
  • Graph isomorphism - CRaB
  • Subgraph query processing - VEQ_S, BICE
  • Diversified top-k subgraph querying - DiversifiedSubgraphQuerying
  • Graph isomorphism query processing - DCQ
  • Subgraph cardinality estimation - FaSTest
  • Time-constrained continuous subgraph matching - TCM
  • Graph similarity search - GSSDH, GSSBBB
  • Top-k frequent subgraph mining - Minting
  • Defective clique enumeration/search - WODC
  • k-Clique listing - DIST
• 자료구조/툴
  • 자료구조 구축 - graphDSLibrary
  • 그래프 생성 - graph-generation-tool
  • 그래프 변환 - graph-transform-tool
  • 그래프 통계 분석 - graph-analysis-tool
  • 그래프 인덱싱 - graph-indexing-tool