Tight bounds on adjacency labels for monotone graph classes.
Édouard BonnetJulien DuronJohn SylvesterViktor ZamaraevMaksim ZhukovskiiPublished in: CoRR (2023)
Keyphrases
- tight bounds
- upper bound
- class labels
- labeled graphs
- lower bound
- label propagation
- equivalence classes
- strongly connected
- graph theory
- graph matching
- random walk
- graph structure
- edge weights
- graph representation
- directed graph
- spanning tree
- bounded degree
- multi label
- graph partitioning
- uniform distribution
- training data
- graph mining
- directed acyclic graph
- structured data
- class membership
- multiple classes
- graph model
- labeling scheme
- graph data
- graph theoretic
- undirected graph
- connected components
- graph cuts
- multi class
- bayesian networks