On listing, sampling, and counting the chordal graphs with edge constraints.
Shuji KijimaMasashi KiyomiYoshio OkamotoTakeaki UnoPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- undirected graph
- weighted graph
- edge information
- random sampling
- image processing
- minimum spanning trees
- planar graphs
- approximation algorithms
- parameter space
- monte carlo
- edge detection
- multiscale
- directed graph
- constraint satisfaction
- bipartite graph
- graph theory
- sample size
- graph model
- pairwise
- graph theoretic
- sampling strategy
- constraint graph
- neural network