Counting non-isomorphic maximal independent sets of the n-cycle graph.
Raymond BisdorffJean-Luc MarichalPublished in: CoRR (2007)
Keyphrases
- independent set
- anti monotonic
- graph representation
- directed graph
- graph theoretic
- stable set
- graph matching
- graph theory
- graph construction
- weighted graph
- minimum spanning tree
- graph partitioning
- graph mining
- graph structure
- bipartite graph
- connected components
- subgraph isomorphism
- random graphs
- dependency graph
- graph model
- edge weights
- graphical representation
- graph databases
- data sets
- directed acyclic graph
- binary images
- np complete
- semi supervised
- lower bound