The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters.
Till TantauPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- worst case
- maximum likelihood
- structured data
- scaling factors
- approximation error
- random walk
- neural network
- weibull distribution
- linear model
- parameter estimation
- data sets
- single parameter
- computational complexity
- graph model
- graph theory
- bipartite graph
- graph matching
- graph structure
- weighted graph
- directed acyclic graph
- parameter settings
- graph mining
- graph representation
- input parameters
- probability density function
- search algorithm
- directed graph
- graph based algorithm
- decision problems