Clique-Width for 4-Vertex Forbidden Subgraphs.
Andreas BrandstädtJoost EngelfrietHoàng-Oanh LeVadim V. LozinPublished in: Theory Comput. Syst. (2006)
Keyphrases
- graph properties
- quasi cliques
- connected subgraphs
- maximum clique
- directed graph
- labeled graphs
- biological networks
- minimum weight
- graph mining
- maximum weight
- branch and bound algorithm
- graph databases
- data structure
- graph theoretic
- undirected graph
- directed acyclic graph
- hamiltonian cycle
- graph structures
- frequently occurring
- vertex set
- graph theory
- frequent subgraph mining
- partial order