895 search results - page 104 / 179 » Using graphs for some discrete tomography problems |
106
click to vote
COMPGEOM
1996
ACM
15 years 2 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
DSD
2007
IEEE
15 years 4 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
WG
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
103
click to vote
STACS
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...