1538 search results - page 64 / 308 » Spectral Techniques in Graph Algorithms |
107
click to vote
ESA
1998
Springer
15 years 5 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
103
click to vote
ACSC
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
120
click to vote
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
15 years 2 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
AAAI
2007
15 years 3 months ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
125
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...