Search Results

Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of living cells. The computation models obtained in the field of membrane computing are usually called P systems. P systems have ...

The independence number of a sparse random graph Gn,m of average degree d = 2m/n is well-known to be 2-εdnlnd/dï αGn,mï 2+εdnlnd/d with high probability, with εdï 0 in the limit of large d. Moreover, a trivial greedy algorithm w.h.p. finds an ...

In wireless ad hoc networks, one of the most important issues impacting performance is wireless interference between adjacent nodes. Such interference problem has often been approached to find independent sets in a topological graph. In general, the ...

We study combinatorial auctions for the secondary spectrum market. In this market, short-term licenses shall be given to wireless nodes for communication in their local neighborhood. In contrast to the primary market, channels can be assigned to ...

For more than 30 years Davis-Putnam-style exponential-time backtracking algorithms have been the most common tools used for finding exact solutions of NP-hard problems. Despite of that, the way to analyze such recursive algorithms is still far from ...

In this paper we introduce the concept of a boundary class, which is a helpful tool for classification of hereditary classes of graphs according to the complexity of the independent set problem. It is shown that in a class X defined by a finite set of ...

We study the online version of the independent set problem in graphs. The vertices of an input graph are given one by one along with their edges to previous vertices, and the task is to decide whether to add each given vertex to an independent set ...