On the acyclic choosability of graphs.
Mickaël MontassierPascal OchemAndré RaspaudPublished in: J. Graph Theory (2006)
Keyphrases
- np hard
- connected graphs
- directed graph
- graph mining
- graph theory
- graph matching
- bounded treewidth
- np complete
- neural network
- markov equivalence classes
- graph clustering
- graph representation
- complex structures
- pattern recognition
- social networks
- databases
- special case
- graph structure
- weighted graph
- data model
- graph model
- graph databases
- database systems
- graph theoretic
- graph data
- image segmentation
- series parallel
- data mining