Fast Compilation of s-t Paths on a Graph for Counting and Enumeration.
Norihito YasudaTeruji SugayaShin-ichi MinatoPublished in: AMBN (2017)
Keyphrases
- graph theory
- graph representation
- shortest path
- model counting
- random walk
- structured data
- graph structure
- graph model
- graph theoretic
- dynamic programming
- directed graph
- stable set
- connected components
- directed acyclic graph
- search space
- fully connected
- weighted graph
- disjoint paths
- maximal clique enumeration
- knowledge compilation
- minimum spanning tree
- graphical representation
- data sets
- data mining
- neural network