Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs.
Prosenjit BoseJean-Lou De CarufelOlivier DevillersPublished in: J. Comput. Geom. (2020)
Keyphrases
- worst case
- computational complexity
- np hard
- graph matching
- graph theory
- pairwise
- upper bound
- routing protocol
- mobile ad hoc networks
- graph mining
- polynomial time complexity
- data sets
- wireless ad hoc networks
- graph construction
- graph theoretic
- graph representation
- graph model
- network topology
- graph structure
- memory requirements
- computational cost
- data mining