Sciweavers

1002 search results - page 18 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
SCAM
2008
IEEE
15 years 6 months ago
Precise Analysis of Java Programs Using JOANA
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
Dennis Giffhorn, Christian Hammer
PPOPP
2012
ACM
13 years 7 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
OOPSLA
1999
Springer
15 years 4 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
ICPP
1995
IEEE
15 years 3 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
ICALP
2009
Springer
16 years 3 days ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin