1749 search results - page 160 / 350 » Conditional colorings of graphs |
209
click to vote
ATAL
2010
Springer
15 years 7 months 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...
195
click to vote
ISBI
2009
IEEE
16 years 1 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
199
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
168
click to vote
EACL
1989
ACL Anthology
15 years 7 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
172
click to vote
INFOVIS
2005
IEEE
16 years 6 days ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...