Clique-widthIn graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph; it is closely related to treewidth, but unlike treewidth it can be small for dense graphs. It is defined as the minimum number of labels needed to construct G by means of the following 4 operations : Creation of a new vertex v with label i (denoted by i(v)) Disjoint union of two labeled graphs G and H (denoted by ) Joining by an edge every vertex labeled i to every vertex labeled j (denoted by η(i,j)), where i ≠ j Renaming label i to label j (denoted by ρ(i,j)) Graphs of bounded clique-width include the cographs and distance-hereditary graphs.
SahysModSahysMod is a computer program for the prediction of the salinity of soil moisture, groundwater and drainage water, the depth of the watertable, and the drain discharge in irrigated agricultural lands, using different hydrogeologic and aquifer conditions, varying water management options, including the use of ground water for irrigation, and several crop rotation schedules, whereby the spatial variations are accounted for through a network of polygons.
TreewidthIn graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest treewidth is 1; the graphs with treewidth 1 are exactly the trees and the forests. The graphs with treewidth at most 2 are the series–parallel graphs. The maximal graphs with treewidth exactly k are called k-trees, and the graphs with treewidth at most k are called partial k-trees. Many other well-studied graph families also have bounded treewidth.
Drawdown (hydrology)In hydrology, there are two similar but distinct definitions in use for the word drawdown: In subsurface hydrogeology, drawdown is the reduction in hydraulic head observed at a well in an aquifer, typically due to pumping a well as part of an aquifer test or well test. In surface water hydrology and civil engineering, drawdown refers to the lowering of the surface elevation of a body of water, the water table, the piezometric surface, or the water surface of a well, as a result of the withdrawal of water.
Buckingham π theoremIn engineering, applied mathematics, and physics, the Buckingham pi theorem is a key theorem in dimensional analysis. It is a formalization of Rayleigh's method of dimensional analysis. Loosely, the theorem states that if there is a physically meaningful equation involving a certain number n of physical variables, then the original equation can be rewritten in terms of a set of p = n − k dimensionless parameters pi1, pi2, ..., pip constructed from the original variables, where k is the number of physical dimensions involved; it is obtained as the rank of a particular matrix.
Branch-decompositionIn graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves. Removing any edge from T partitions the edges of G into two subgraphs, and the width of the decomposition is the maximum number of shared vertices of any pair of subgraphs formed in this way. The branchwidth of G is the minimum width of any branch-decomposition of G.
