For undirected graphs G (V, E) and G0 (V0 , E0), say that G is a region intersection graph over G0 if there is a family of connected subsets {Ru ⊆ V0 : u ∈ V} of G0 such that {u , v} ∈ E ⇐⇒ Ru ∩ Rv , ∅. We show if G0 excludes the complete graph Kh as a minor for some h > 1, then every region intersection graph G over G0 with m edges has a balanced separator with at most ch √ m nodes, where ch i...

Pulsating technology joins ultra-efficient screens for the utmost in cuttings treatment, fluid recovery

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...