Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities

PoE refers to the maximum size subset of U that can be extended to a minimal feasible solution. A framework for extension problems is developed in [10] where a number of results

Dans son arrêt de 2017, le Tribunal fédéral affirme clairement que, en principe, dans le secteur public, le droit des représentants syndicaux d’accéder aux locaux

We show an upper bound for the maximum vertex degree of any z-oblique graph imbedded into a given surface.. Moreover, an upper bound for the maximum face degree

We notice that the Branch-and-Cut-and-Price algorithm of the isolating-separator formulation could not solve one DIMACS instance of 500 nodes while it solved all random instances.

We show that the decision versions of the minimum cover and partition by γ-quasi-cliques problems are NP-complete for any fixed γ satisfying 0 < γ < 1.. Key-words:

and b) to arr'ive at representative values for rotational corrections f o r towers and chimneys. L and the mode shapes, reproduced from Ref. A summary of

The estimated characteristic impedance is compared to a theoretical

Figure 1. Geometry of a hot spot on the surface of a neutron star rotating at an angular frequency Ω. A photon emitted from the surface at an angle α with respect to the local