120 search results - page 20 / 24 » dm 2006 |
90
Voted
DM
2006
14 years 9 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
DM
2006
14 years 9 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
DM
2006
14 years 9 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
RTS
2008
14 years 9 months ago
2008
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where ...
102
Voted
DM
2006
14 years 9 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...