Techniques described herein relate to a method for computation of network flooding topologies. A flooding topology may refer to a subset of a network which can be utilized by a network device to limit the flooding of link state updates. The flooding topology may be determined by an area leader (i.e., a designated network device) of the network. Computation of the flooding topology may entail the iterative incorporation (or absorption) of nodes and edges of a first connected graph, representing network devices and interconnections of a network topology of the network, into a second connected graph representing the flooding topology.