For MSO2-expressible problems like Edge Dominating Set or Hamiltonian Cycle, it was open for a long time whether there is an algorithm which given a clique-width k-expression of an n-vertex graph runs in time f(k) · nO(1) for some function f . Recently, Fomin et al. (SIAM. J. Computing, 2014) presented several lower bounds; for instance, there are no f(k) · n-time algorithms for Edge Dominating...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

Gary Brassington is first introducing this newsletter with a paper telling us about the international summer school for “observing, assimilating and forecasting the ocean” which will be held in Perth, Western Australia in 11-22 January 2010 (http://www.bom.gov.au/bluelink/summerschool/). The course curriculum will include topics covering the leading edge science in ocean observing systems, as w...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

This paper presents some bounds on the number of Laplacian eigenvalues contained in various subintervals of [0, n] by using the matching number and edge covering number for G, and asserts that for a connected graph the Laplacian eigenvalue 1 appears with certain multiplicity. Furthermore, as an application of our result (Theorem 13), Grone and Merris’ conjecture [The Laplacian spectrum of graph...

may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modifications of the content of this paper are prohibited. Abstract: We present an edge extraction method based on aperture synthesis with different pupils in optical scanning holography. By utilizing two sub-holograms covering different...

We show that the maximum degree of a graph G is equal to theminimum number of ocm sets covering G, where an ocm set is the vertex-disjoint union of elementary odd cycles and onematching, and a collection of ocm sets covers G if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets. © 2013 Elsevier B.V. All rights reserved.

This paper describes an innovative sensor system which can detect and track people in a room by means of an array of capacitive sensors beneath the floor covering. By combining cutting-edge technology from the domains of capacitive sensing, wireless data transmission, interconnecting technology between textiles and microelectronics and high level data processing it is possible to support variou...