A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.
Bruno CourcelleRodney G. DowneyMichael R. FellowsPublished in: J. Univers. Comput. Sci. (1997)
Keyphrases
- graph theory
- random walk
- finite sets
- graph representation
- directed acyclic graph
- graph structure
- structured data
- graph theoretic
- higher order
- connected components
- graph based algorithm
- graphical representation
- spanning tree
- graph model
- deductive databases
- graph matching
- directed graph
- high order
- data sources
- data model
- graph clustering
- datalog programs
- bayesian networks