Structures of Critical Nontree Graphs with Cutwidth Four

Article Computer Science, Interdisciplinary Applications

Decomposability of a class of k-cutwidth critical graphs

Zhen-Kun Zhang et al.

Summary: The paper mainly investigates a class of decomposable k-cutwidth critical graphs for k >= 2, which can be decomposed into three (k - 1)-cutwidth critical subgraphs.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Add to Collection

Article Construction & Building Technology

Generation of optimal (de)centralized layouts for urban drainage systems: A graph-theory-based combinatorial multi-objective optimization framework

Sina Hesarkazzazi et al.

Summary: Recent research has shown the suitability and effectiveness of decentralized paradigms in the field of underground conveyance drainage infrastructures for addressing sustainability and resilience demands. A scheme is proposed in this study to create and optimize decentralization scenarios for sewer layout configurations, reducing design construction costs and improving network resilience.

SUSTAINABLE CITIES AND SOCIETY (2022)

Add to Collection

Article Mathematics, Applied