Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.
Mourad BaïouLaurent BeaudouZhentao LiVincent LimouzyPublished in: ISAAC (2013)
Keyphrases
- directed graph
- computational complexity
- maximum flow
- strongly connected
- worst case
- graph structures
- web graph
- np hard
- computational cost
- related algorithms
- random walk
- graph structure
- graph properties
- learning algorithm
- graph theory
- binary images
- upper bound
- evolutionary algorithm
- clustering method
- directed acyclic graph
- undirected graph
- constraint satisfaction problems
- edge weights
- computationally efficient
- np complete
- significant improvement
- maximum clique