Reachability Is Harder for Directed than for Undirected Finite Graphs.
Miklós AjtaiRonald FaginPublished in: J. Symb. Log. (1990)
Keyphrases
- weighted graph
- directed graph
- undirected graph
- graph theory
- graph matching
- graph partitioning
- graph model
- state space
- np complete
- bipartite graph
- graph theoretic
- graph structure
- adjacency matrix
- search algorithm
- chain graphs
- structured objects
- graph construction
- directed edges
- transitive closure
- spanning tree
- graph representation
- graph kernels
- neural network
- graph structures
- random walk
- subgraph isomorphism
- series parallel
- optimal solution
- reinforcement learning
- data mining