Here are some. Some may not be graph but still good to check.
DIjkstra’s Algorithm: Shortest path
Depth-first search
Bezier Curve
A search algorithm or A* algorithm
Johnson’s algorithm for sparse graphs
Huffman Coding (greedy algorithms
Prim’s Algorithm (Minimum Spanning trees)
Kalman filters
Kruskal’s Algorithm (Minimum Spanning trees)
Bellman- Ford Algorithm (single source shortest paths)
Randomized sorting/Monte Carlo algorithm
Knuth-Morris-Pratt Algorithms
Floyd-Warshall algorithms(All pairs shortest path)
Cohen-sutherland outcode algorithm
Graham’s Scan
Sutherland hodgman algorithm
Johnson’s algorithm for sparse graphs
Mid point circle drawing algorithm
Markov chain Monte Carlo algorithms
Merging networks
Vertex-Cover algorithm
Bitonic sorting network
Appel’s algorithms
Memory found heuristic search
Graphplan algorithm
Lifet-to-fornt algorithms
These are some recent tree based routing protocols in Wireless networks:
A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network,
Exploring mesh and tree-based multicast. Routing protocols for MANETs
Power-aware dual-tree-based multicast routing protocol for mobile ad hoc networks
Tree-Based Clustering(TBC) for Energy Efficient Wireless Sensor Networks
You can refer the book "Distributed Graph Algorithms for Computer Networks"
I had attached the book Pdf for your reference.
Some of the well known algorithms are
1. Bitonic sorting algorithm
2. DIjkstra’s Algorithm: Shortest path
3. Johnson’s algorithm for sparse graphs
- Badges
- Science topic