3211 search results - page 146 / 643 » On the Grundy Number of a Graph |
165
click to vote
ICDM
2006
IEEE
16 years 13 days ago
2006
IEEE
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
162
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
169
click to vote
CN
2007
15 years 6 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
188
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
143
click to vote
JGT
2006
15 years 6 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...