A Note on Polynomial-time Solvability for Edge Packing on Graphs.
Jiaxin LiuXuerong YueZhibin ChenPublished in: ICCNS (2019)
Keyphrases
- weighted graph
- undirected graph
- graph isomorphism
- special case
- polynomial time complexity
- bounded treewidth
- approximation algorithms
- edge detection
- packing problem
- hypothesis spaces
- minimum spanning trees
- edge detector
- planar graphs
- graph mining
- edge weights
- graph matching
- computational complexity
- graph clustering
- graph model
- graph theory
- directed graph
- series parallel
- vertex set
- graph databases
- edge information
- subgraph isomorphism
- graph search