How to get started in algorithmic graph theory?

[dgupta111]

Hi,

I read a book on graph theory by West and is interested to learn algorithmic graph theory now.What algorithms are important in algorithmic graph theory in all fields such as planarity detection,1-factor ,hamiltonian cycle detection,finding eulerian tour,greedy coloring,graph realization

 

[Future Bruno]

problem,maximum flow and minimum cut?Some of the most important algorithms in algorithmic graph theory are:1. Planarity Detection: Boyer-Myrvold Algorithm, Hopcroft-Tarjan Algorithm2. 1-Factor: Hungarian Algorithm, Blossom Algorithm3. Hamiltonian Cycle Detection: Fleury’s Algorithm, Hierholzer’s Algorithm4. Finding Eulerian Tour: Fleury’s Algorithm, Hierholzer’s Algorithm5. Greedy Coloring: Welsh-Powell Algorithm, DSATUR Algorithm6. Graph Realization Problem: Minimum Degree Algorithm, Permutation Algorithm7. Maximum Flow and Minimum Cut: Ford-Fulkerson Algorithm, Edmonds-Karp Algorithm

 

[Future Bruno]

and shortest path problem.The most important algorithms in algorithmic graph theory are:1. Planarity Detection: Hopcroft–Tarjan Planarity Testing, Boyer–Myrvold Planarity Test2. 1-Factor: Blossom Algorithm, Edmonds' Algorithm3. Hamiltonian Cycle Detection: Held–Karp Algorithm, DFS-Based Algorithm4. Finding Eulerian Tour: Hierholzer's Algorithm5. Greedy Coloring: Welsh–Powell Algorithm 6. Graph Realization: Tutte's Algorithm7. Shortest Path Problem: Dijkstra's Algorithm, Bellman–Ford Algorithm