A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs.
Mohammed LalouHamamache KheddouciPublished in: Optim. Lett. (2019)
Keyphrases
- graph structure
- computational complexity
- detection algorithm
- worst case
- dynamic programming
- polynomial time complexity
- undirected graph
- graph model
- objective function
- learning algorithm
- np hard
- expectation maximization
- finding the shortest path
- fully connected
- bipartite graph
- matching algorithm
- segmentation algorithm
- k means
- directed graph
- weighted graph
- graph theoretic
- np complete
- polynomial size
- adjacency graph
- graph isomorphism
- probabilistic model