29 search results - page 6 / 6 » Upper domination and upper irredundance perfect graphs |
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
RTSS
1992
IEEE
13 years 11 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...