A Characterization of Well Covered Graphs of Girth 5 or Greater.
Art S. FinbowBert L. HartnellRichard J. NowakowskiPublished in: J. Comb. Theory, Ser. B (1993)
Keyphrases
- graph matching
- data sets
- graph clustering
- graph theoretic
- graph theory
- complex structures
- subgraph isomorphism
- graph construction
- graph representation
- graph partitioning
- spanning tree
- graph databases
- significantly higher
- bipartite graph
- directed graph
- search algorithm
- multiscale
- bayesian networks
- computer vision
- artificial intelligence
- data mining