Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract).
Wenbo SunIvona BezákováPublished in: AAAI (2021)
Keyphrases
- undirected graph
- learning environment
- student learning
- knowledge level
- graph matching
- connected graphs
- higher level
- learning styles
- student model
- uniform random
- intelligent tutoring systems
- monte carlo
- np complete
- johnson lindenstrauss
- learning process
- np hard
- database schemes
- bounded treewidth
- sampling strategy
- sampling methods
- high school students
- sampling algorithm
- directed graph
- high level
- parameter space
- computer programming
- graph mining
- university level
- tutoring system
- graph structure
- graph theory
- graph theoretic
- sample size
- spanning tree
- graph clustering
- online course