Maximum graphs not spannable by r disjoint paths.
M. AlabdullatifK. WalkerPublished in: Discret. Math. (1999)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- maximum number
- directed acyclic graph
- graph structure
- graph matching
- graph theoretic
- spanning tree
- graph databases
- graph mining
- connected components
- neural network
- weighted graph
- graph construction
- graph model
- random walk
- pattern mining
- worst case
- np hard
- graph partitioning
- labeled graphs
- genetic algorithm