Generating sequences of clique-symmetric graphs via Eulerian digraphs.
John P. McSorleyThomas Dale PorterPublished in: Discret. Math. (2004)
Keyphrases
- directed graph
- graph properties
- undirected graph
- hidden markov models
- independent set
- graph theory
- maximum clique
- equivalence classes
- sequential patterns
- graph theoretic
- random walk
- quasi cliques
- random graphs
- markov models
- graph model
- graph matching
- graphical representation
- complex structures
- graph databases
- phylogenetic trees
- graph mining
- approximation algorithms