3211 search results - page 93 / 643 » On the Grundy Number of a Graph |
CORR
2011
Springer
13 years 25 days ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
SIGMOD
2005
ACM
14 years 2 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
COMBINATORICS
2000
13 years 9 months ago
2000
Let (G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that (G)(H) 2(G H) for all simple graphs G and H. 2000 Math...