Asymptotic enumeration on self-similar graphs with two boundary vertices.
Elmar TeuflStephan G. WagnerPublished in: Discret. Math. Theor. Comput. Sci. (2009)
Keyphrases
- weighted graph
- labeled graphs
- maximal cliques
- undirected graph
- attributed graphs
- maximal clique enumeration
- random graphs
- hamiltonian cycle
- adjacency matrix
- average degree
- planar graphs
- edge weights
- graph theory
- graph theoretic
- directed edges
- directed graph
- maximum cardinality
- vertex set
- hidden markov models
- graph matching
- graph mining
- connected subgraphs
- query graph
- graph clustering
- spanning tree
- fractal dimension
- object boundaries
- boundary points
- graph data
- expected values
- graph partitioning
- critical points
- graph databases
- connected graphs
- worst case
- dynamic programming