A comment on pure-strategy Nash equilibria in competitive diffusion games
In [N. Alon, M. Feldman, A.D. Procaccia, M. Tennenholtz, A note on competitive diffusion through social networks, Inform. Process. Lett. 110 (2010) 221-225], the authors introduced a game-theoretic model of diffusion process through a network. They ...
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Let M"k={u"i,v"i}"i"="1^k be a set of k pairs of distinct vertices of the n-dimensional hypercube Q"n such that it contains k vertices from each class of bipartition of Q"n. Gregor and Dvorak proved that if n>2k, then there exist k vertex-disjoint paths ...
Maximum Weight Independent Sets in hole- and co-chair-free graphs
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-...
A note on a single machine scheduling problem with generalized total tardiness objective function
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new graphical algorithm ...
A dichotomy in the complexity of consistent query answering for queries with two atoms
We establish a dichotomy in the complexity of computing the consistent answers of a Boolean conjunctive query with exactly two atoms and without self-joins. Specifically, we show that the problem of computing the consistent answers of such a query ...
Flipping the winner of a poset game
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element and all ...
Analysis of total average queue length in multi-hop wireless networks
In upcoming communication environments, multi-hop networking is expected to be pervasive in wireless access and backbone networks because it promises large coverage and increased capacity. Many studies have been devoted to the throughput of multi-hop ...
A neighborhood condition for graphs to be maximally k-restricted edge connected
For a connected graph G=(V,E), an edge set S@__ __E is a k-restricted edge cut if G-S is disconnected and every component of G-S has at least k vertices. The k-restricted edge connectivity of G, denoted by @l"k(G), is defined as the cardinality of a ...
Increasing the flexibility of the herding attack
Chosen-target-forced-prefix (CTFP) preimage resistance is a hash function security property guaranteeing the inability of an attacker to commit to a hash function outcome h without knowing the prefix of the message to be hashed in advance. At EUROCRYPT ...
