Sciweavers

3757 search results - page 117 / 752
» The overlap number of a graph
Sort
View
DAM
2011
14 years 5 months ago
A study of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
Martin Knor, Guangjun Xu, Sanming Zhou
ICPR
2002
IEEE
15 years 11 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 2 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
ICPP
2009
IEEE
15 years 4 months ago
Optimizing the Latency of Streaming Applications under Throughput and Reliability Constraints
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
Anne Benoit, Mourad Hakem, Yves Robert
ISVC
2009
Springer
15 years 4 months ago
GPU-Based Ray Casting of Multiple Multi-resolution Volume Datasets
We developed a GPU-based volume ray casting system for rendering multiple arbitrarily overlapping multi-resolution volume data sets. Our efficient volume virtualization scheme is b...
Christopher Lux, Bernd Fröhlich