On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree.
Andrzej ZakPublished in: SIAM J. Discret. Math. (2014)
Keyphrases
- graph matching
- absolute difference
- bounded treewidth
- random graphs
- graph theoretic
- graph theory
- graph representation
- packing problem
- aggregation functions
- weighted graph
- graph mining
- graph partitioning
- degree distribution
- graph construction
- power law
- data sets
- maximum number
- graph model
- directed graph
- bayesian networks
- similarity measure