990 search results - page 102 / 198 » Sub-Graphs of Complete Graph |
RTA
2010
Springer
14 years 26 days ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
CC
2006
Springer
14 years 21 days ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
ITS
2000
Springer
14 years 17 days ago
2000
Springer
We developed a distributed support model in an interface for distant learning. The support is integrated into the ExploraGraph navigator which makes it possible to navigate through...
ADMA
2008
Springer
13 years 11 months ago
2008
Springer
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
DAGSTUHL
2006
13 years 10 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...