Counting and Sampling Labeled Chordal Graphs in Polynomial Time.
Úrsula Hébert-JohnsonDaniel LokshtanovEric VigodaPublished in: ESA (2023)
Keyphrases
- labeled graphs
- graph isomorphism
- undirected graph
- bounded treewidth
- special case
- polynomial time complexity
- planar graphs
- sample size
- random sampling
- graph matching
- approximation algorithms
- supervised learning
- training data
- computational complexity
- directed graph
- graph theory
- graph mining
- monte carlo
- np complete
- training set
- subgraph isomorphism
- bipartite graph
- uniform random
- graph theoretic
- graph representation
- graph partitioning
- data sets
- structured data
- missing data
- learning algorithm