VC-density and abstract cell decomposition for edge relation in graphs of bounded twin-width.
Wojciech PrzybyszewskiPublished in: CoRR (2022)
Keyphrases
- weighted graph
- undirected graph
- structural learning
- edge detection
- minimum spanning trees
- edge information
- decomposition method
- higher level
- graph matching
- bounded treewidth
- graph theory
- graph theoretic
- graph partitioning
- graph representation
- adjacency graph
- vertex set
- directed graph
- edge detector
- graph model
- high level
- subgraph isomorphism
- abstraction hierarchy
- bounded degree
- graph structures
- decomposition algorithm
- spanning tree
- edge map
- random graphs
- low density
- graph structure
- edge weights
- random walk
- vc dimension