A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph.
Naoto OhsakaPublished in: CoRR (2021)
Keyphrases
- computational complexity
- computational effort
- execution times
- memory requirements
- times faster
- cost function
- high accuracy
- detection algorithm
- dynamic programming
- linear programming
- space complexity
- recognition algorithm
- learning algorithm
- small number
- optimal solution
- preprocessing
- search space
- significant improvement
- worst case
- objective function
- undirected graph
- k means
- optimization algorithm
- theoretical analysis
- computational cost
- probabilistic model
- np hard
- clustering method
- matching algorithm
- segmentation algorithm
- convergence rate
- np complete
- graph structure
- expectation maximization
- simulated annealing