Counting and Sampling Labeled Chordal Graphs in Polynomial Time.
Úrsula Hébert-JohnsonDaniel LokshtanovEric VigodaPublished in: CoRR (2023)
Keyphrases
- graph isomorphism
- undirected graph
- labeled graphs
- special case
- bounded treewidth
- polynomial time complexity
- uniform random
- approximation algorithms
- sample size
- graph matching
- computational complexity
- random sampling
- graph representation
- sampling algorithm
- sampling strategy
- supervised learning
- weighted graph
- graph model
- graph structure
- graph theoretic
- worst case
- training data
- graph partitioning
- np complete
- adjacency graph
- np hard