35 search results - page 7 / 7 » mfcs 2007 |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...