Clique-Width for Four-Vertex Forbidden Subgraphs.
Andreas BrandstädtJoost EngelfrietHoàng-Oanh LeVadim V. LozinPublished in: FCT (2005)
Keyphrases
- quasi cliques
- connected subgraphs
- maximum clique
- graph properties
- directed graph
- labeled graphs
- maximum weight
- minimum weight
- association graph
- branch and bound algorithm
- independent set
- biological networks
- graph theoretic
- graph theory
- subgraph matching
- frequently occurring
- data structure
- maximal clique enumeration
- undirected graph
- computational biology
- graph mining
- attributed graphs
- edge weights
- subgraph mining
- directed acyclic graph
- connected components
- lower bound