A k-container C(u, v) of a graph G is a set of kdisjoint paths joining u to v. A k-container C(u, v) of G is k∗-container if C(u, v) spans G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let κ(G) be the connectivity of G. In this paper, we prove that the n-dimensional burnt pancake graph Bn is n∗connected for any positive integer n.

A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all vertices of G. A graph G is k∗connected if there exists a k∗-container between any two distinct vertices. In this paper, we prove that the n-dimensional fully connected cubic network FCCNn is 3 ∗-connected for n ≥ 2.

We present three diierent methods for nding solutions to the 2D translation-only containment problem: nd translations for k polygons that place them inside a given polygonal container without overlap. Both the container and the polygons to be placed in it may be nonconvex. First, we provide several exact algorithms that improve results for k = 2 or k = 3. In particular, we give an algorithm for...

We propose a new index, the Container Port Connectivity Index (CPCI), to measure the trade connectivity of ports within the network of container shipping. This index is based on both economics and network topology, and a distinctive feature is that the strength of a port is based on its position within the global structure of the shipping network and not just on local information such as the nu...

Being aimed at the influence of ship-size and cargo-demand changes on container shipping networks, to reveal the evolution process of container shipping networks structure form, this paper respectively designed the operation models for two major container shipping networks structure forms: Multi-port-calling network and Hub-and-spoke network, to maximizing the investment efficiency. Based on th...

In this paper, we propose and evaluate a novel recognition algorithm for container identifiers that effectively overcomes these difficulties and recognizes identifiers from container images captured in various environments. The proposed algorithm, first, extracts the area containing only the identifiers from container images by using CANNY masking and bi-directional histogram method. The extrac...

Container-dwelling mosquitoes use a wide variety of container habitats. The bottle cap is often cited as the smallest container habitat used by container species. When containers are small, the habitat conditions can greatly affect evaporation rates that in turn can affect the species dynamics within the container. An evaporation rate model was adapted to predict evaporation rates in mosquito c...

A program derivation is said to be polytypic if some of its parameters are data types. Often these data types are container types, whose elements store data. Polytypic program derivations necessitate a general, non-inductive deenition of`container (data) type'. Here we propose such a deenition: a container type is a relator that has membership. It is shown how this deenition implies various oth...

Container-dwellingmosquitoes use a wide variety of container habitats. The bottle cap is often cited as the smallest container habitat used by container species. When containers are small, the habitat conditions can greatly affect evaporation rates that in turn can affect the species dynamics within the container. An evaporation ratemodel was adapted to predict evaporation rates inmosquito cont...

A container for cargo use travels various countries with a lot of kinds of goods. It arrives at a place with some goods, and then it leaves to a different place with different goods. A container itself is a kind of transportation in the viewpoint from goods. We imagined if the goods were we, a container would be a train. We have proposed a new experience-based artwork using a container to resem...