On characterizing game-perfect graphs by forbidden induced subgraphs.
Stephan Dominique AndresPublished in: Contributions Discret. Math. (2012)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- labeled graphs
- graph structures
- subgraph matching
- graph data
- reachability queries
- maximum common subgraph
- connected subgraphs
- maximum clique
- subgraph mining
- game playing
- frequent subgraph mining
- frequent subgraphs
- game theory
- video games
- data structure
- educational games
- nash equilibrium
- computer games
- graph theory
- graph matching
- game theoretic
- graph theoretic
- dense subgraphs
- game play
- graph patterns
- graph representation
- maximal cliques
- topological information
- pattern mining
- structured data
- graph model
- directed graph
- graph search
- optimal strategy
- game design
- directed acyclic graph
- bipartite graph