Best-rst search algorithms have been widely used to nd a minimum cost path in graph search. To formulate certain problems involving temporal events, it is at times instrumental to use graphs whose edge costs are time-dependent. In such a graph, shortest paths are dependent on time at which traversal in the graph begins. Typically, structural changes in t occur at discrete points in t, where t i...

In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...