Vertex separators, that is, vertex sets whose deletion disconnects two distinguished vertices ina graph, play a pivotal role in algorithmic graph theory. For instance, the concept of tree decom-positions of graphs is tightly connected to the separator concept. For many realistic models of thereal world, however, it is necessary to consider graphs whose edge set changes with time...

In this paper, we develop generalized methods to layout homogeneous product networks with any number of dimensions, and analyze their VLSI complexity by deriving upper and lower bounds on the area and maximum wire length. In the literature, lower bounds are generally obtained by computing lower bounds on the bisection width or the crossing number of the network being laid out. In this paper, we...

The problems associated with the presence of sediments in sewers and stormwater drainage systems represent a major engineering challenge. Their accumulation can result in operational difficulties, including low restriction and premature overflows. Sediments themselves are known to contribute significantly to the polluting load of storm overflows. The use of sediment interceptors within sewer sy...

Abstract For n -vertex graphs with treewidth $$k = O(n^{1/2-\epsilon })$$ k = O ( n 1 / 2 - ϵ ) </mml:math...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...