Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue
of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it …

Decompositional parameters such as treewidth are commonly used to obtain fixed-
parameter algorithms for-hard graph problems. For problems that are-hard parameterized by …

Atomic congestion games are a classic topic in network design, routing, and algorithmic
game theory, and are capable of modeling congestion and flow optimization tasks in various …

We introduce graph width parameters, called-edge-crossing width and edge-crossing width.
These are defined in terms of the number of edges crossing a bag of a tree-cut …

Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue
of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it …

In an edge‐colored graph, a traversal cost occurs along a path when consecutive edges
with different colors are traversed. The value of the traversal cost depends only on the colors …

The reload cost refers to the cost that occurs along a path on an edge‐colored graph when it
traverses an internal vertex between two edges of different colors. Galbiati et al. introduced …

We study the minimum diameter spanning tree problem under the reload cost model
(Diameter‐Tree for short) introduced by Wirth and Steffan. In this problem, given an …

The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex
via two of its incident edges. This cost is uniquely determined by the colors of the two edges …

Aiming at the current situation of low management efficiency and information level of art
open laboratory, a design concept of intelligent laboratory management system based on …