Arpita_Hanjagi
Arpita_Hanjagi
Algorithm: Hierholzer’s Algorithm Purpose: Finds an Eulerian circuit in a graph, visiting every edge exactly once. Theory: Starts at any vertex and follows edges to form a cycle; additional cycles...
Algorithm: PageRank Purpose: Measures the importance of vertices (pages) in a directed graph based on incoming links. Theory: Pages linked by important pages receive higher rank. Iterative computation with damping...
Algorithm: Stoer–Wagner Minimum Cut Purpose: Finds the global minimum cut in an undirected weighted graph. Theory: Repeatedly merges vertices while tracking the most tightly connected set, updating the minimum cut...
Algorithm: Bron–Kerbosch Purpose: Finds all maximal cliques in an undirected graph. Theory: Uses recursive backtracking with three sets: R – currently growing clique P – potential vertices to add X...
Algorithm: Louvain Method for Community Detection Purpose: Detects communities or clusters in an undirected graph by optimizing modularity. Theory: Each node starts in its own community. Iteratively moves nodes to...
Algorithm: Gomory-Hu Tree Purpose: Represents all-pairs minimum cuts in an undirected weighted graph as a tree. Theory: Each edge in the tree corresponds to a minimum cut between its endpoints....
Algorithm: Yen's K Shortest Paths Purpose: Finds the K shortest loopless paths between a source and target in a weighted directed graph. Theory: Starts with the shortest path using Dijkstra....
Algorithm: Random Walk with Restart (RWR) Purpose: Computes relevance scores of nodes in a graph based on a random walker that restarts at a source node with a fixed probability....
Determines whether two graphs are isomorphic (structurally identical). Uses the VF2 algorithm, which is a backtracking approach with feasibility checks. Checks both node compatibility and edge compatibility for already-mapped nodes....