684 search results - page 10 / 137 » A characterization of b-perfect graphs |
59
Voted
EJC
2006
14 years 11 months ago
2006
DM
2002
14 years 11 months ago
2002
115
click to vote
ATAL
2010
Springer
15 years 25 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
109
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...