DFS Timestamp Structures and Intervals

Lecture 31 of CS502 Fundamentals of Algorithms explores the mathematical properties of Depth-First Search timestamps and interval theorems. DFS maintains a global discrete simulation clock that increments each time a vertex changes state. For each vertex u, DFS records two timestamps: discovery time d[u] when u is first encountered and colored gray, and finishing time f[u] when its entire adjacency list has been explored and u is colored black. Since each vertex is discovered once and finished once, timestamps range between 1 and 2|V|. The lecture proves the fundamental Parenthesis Theorem: for any two vertices u and v, their lifetime intervals [d[u], f[u]] and [d[v], f[v]] are either completely disjoint, or one interval is strictly nested inside the other, indicating an ancestor-descendant relationship in the DFS tree. The White-Path Theorem is also established, proving that v is a descendant of u if and only if at time d[u], there exists a path of entirely undiscovered white vertices connecting u to v. Practical code illustrations demonstrate iterative and recursive implementations, memoized table lookups, and pointer-based data structures. Geometric computational techniques including sweep-line approaches are investigated to demonstrate spatial dimension reduction in algorithms. Scholars analyze matrix multiplication parenthesization and edit distance dynamic tables to internalize two-dimensional state memoization. Network flow principles and bipartite matching formulations are examined as extensions of core graph optimization methodologies. The relationship between decision problems, certificate verification, and non-deterministic polynomial time is reinforced through formal definitions. In this lecture, students examine formal computational models, asymptotic behavior, and mathematical proofs of algorithmic correctness. Through detailed theoretical breakdowns, the lesson explores running time recurrence equations, recursion trees, and asymptotic bounds. Special emphasis is placed on worst-case execution bounds, operational space requirements, and optimal substructure formulations. Mastering these foundational algorithmic paradigms empowers software engineers to design highly scalable, computationally efficient software applications. Analytical exercises and algorithmic traces help students prepare thoroughly for Virtual University midterm and final term examinations. The curriculum systematically aligns theoretical algorithmic principles with practical implementation paradigms in modern computing systems.