On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6.
Dmitry I. IgnatovPublished in: ICFCA (2023)
Keyphrases
- independent set
- graph representation
- weighted graph
- structured data
- graph theoretic
- databases
- graph theory
- graph mining
- random walk
- graph matching
- graph structure
- graph model
- polynomial delay
- directed acyclic graph
- master slave
- graph partitioning
- connected components
- edge weights
- graph construction
- dependency graph
- pattern mining
- bounded degree
- probabilistic model