3958 search results - page 189 / 792 » Dynamic Graph Algorithms with Applications |
165
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
157
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
195
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
154
click to vote
ICPPW
2006
IEEE
16 years 16 days ago
2006
IEEE
In this paper, we present a runtime method for scheduling parallel applications on dynamic and heterogeneous platforms. It can be used to schedule parallel applications whose tota...
205
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...