3211 search results - page 200 / 643 » On the Grundy Number of a Graph |
169
click to vote
COMAD
2009
15 years 7 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
180
click to vote
CMOT
2004
15 years 6 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
198
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
176
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
142
click to vote
MP
2002
15 years 6 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov