Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)
Miklós AjtaiRonald FaginPublished in: FOCS (1988)
Keyphrases
- preliminary version
- directed graph
- weighted graph
- undirected graph
- state space
- random graphs
- graph matching
- graph theoretic
- chain graphs
- np hard
- graph structure
- unit length
- transitive closure
- graph model
- approximation algorithms
- object recognition
- search algorithm
- knowledge base
- graph theory
- bipartite graph
- graph partitioning
- graph representation
- graphical models
- edge weights
- undirected graphical models
- neural network