Composition of graphs and the triangle free subgraph polytope.
Fatiha BendaliAli Ridha MahjoubJean MailfertPublished in: Electron. Notes Discret. Math. (2000)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph classification
- labeled graphs
- graph properties
- directed graph
- graph data
- dense subgraphs
- connected subgraphs
- query graph
- hamiltonian cycle
- graph search
- frequent subgraph mining
- lattice points
- convex hull
- stable set
- maximum clique
- graph theory
- subgraph mining
- random walk
- np hard
- maximum common subgraph
- graph theoretic
- bipartite graph
- frequent subgraphs
- biological networks
- structured data
- pattern mining
- graph matching
- web services
- graph structures
- graph mining algorithms
- np complete
- regular expressions
- weighted graph
- directed acyclic graph
- similarity graph
- undirected graph
- web service composition
- small world
- graph patterns