106 search results - page 13 / 22 » Dominating direct products of graphs |
ANOR
2008
13 years 7 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
HIPC
2005
Springer
14 years 26 days ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
KRDB
1998
13 years 8 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
ISPAN
2002
IEEE
14 years 8 days ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
DAC
2004
ACM
14 years 24 days ago
2004
ACM
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...