694 search results - page 14 / 139 » Open Graphs and Computational Reasoning |
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
PARA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
DATE
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...