3211 search results - page 178 / 643 » On the Grundy Number of a Graph |
168
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
142
click to vote
IPL
2008
15 years 6 months ago
2008
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
149
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
180
click to vote
ENDM
2002
15 years 6 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
145
click to vote
OTM
2007
Springer
16 years 18 days ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...