Titlebook: Combinatorial Optimization and Applications; 6th International Co Guohui Lin Conference proceedings 2012 Springer-Verlag Berlin Heidelberg

易改變

Maximum Matching in Multi-Interface Networks, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface..In this paper, we consider the standard matching problem in the context of multi-interface wireless networks. The aim is to maximize the number of parallel connect

招惹

Stretch Factor in Wireless Sensor Networks with Directional Antennae,as been some recent study using a model where sensors transmit using a directional antenna. This study has focused on the problem of finding an optimal transmission range so that there exists an orientation of the antennae at each sensor which creates a strongly connected communication network. This

Amylase

On the Minimum Diameter Cost-Constrained Steiner Tree Problem,and a given constant C.?≥?0, the aim is to find a minimum diameter Steiner tree whose all terminals appear as leaves and the cost of tree is bounded by C.. The diameter of tree refers to the maximum weight of the paths connecting two different leaves in the tree. This problem is called the minimum d

Explosive

On Zero Forcing Number of Permutation Graphs, after finitely many applications of “the color-change rule”: a white vertex is converted black if it is the only white neighbor of a black vertex. Zero forcing number was introduced and used to bound the minimum rank of graphs by the “AIM Minimum Rank – Special Graphs Work Group”. Let .. and .. be

歸功于

Constituent

抵消

ferment

Crossing Angles of Geometric Graphs,between crossing edges in a straight line drawing of .. We show that an .-vertex graph . with can(.)?=?.(1) has .(.) edges, but there are graphs . with bounded degree and arbitrarily large can(.). We also initiate studying the . of geometric graphs. We construct bounded degree graphs .?=?(.,.) such

四目在模仿

NIP

Radiation Hybrid Map Construction Problem Parameterized,lem is known to be .-complete even when all gene clusters are of size two and the corresponding problem (..) admits efficient constant-factor approximation algorithms. In this paper, for the first time, we consider the more general case when the gene clusters can have size either two or three (..).