On kernel-less clique-acyclic orientations of minimally imperfect graphs.
Tadashi SakumaPublished in: Discret. Appl. Math. (2001)
Keyphrases
- graph kernels
- independent set
- maximum clique
- connected graphs
- np hard
- graph properties
- graph theory
- graph theoretic
- maximum independent set
- kernel function
- database schemes
- kernel methods
- quasi cliques
- graph matching
- bipartite graph
- maximal cliques
- association graph
- kernel machines
- graph model
- maximal clique enumeration
- graph mining
- social networks
- similarity function
- structured data
- np complete
- feature space
- support vector
- markov equivalence classes
- maximum weight
- bounded treewidth
- positive definite
- random graphs
- graph clustering
- gaussian processes
- weighted graph