678 search results - page 69 / 136 » Structural Properties of Sparse Graphs |
POPL
1997
ACM
14 years 1 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
ECBS
2003
IEEE
14 years 2 months ago
2003
IEEE
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
ICCV
2009
IEEE
15 years 28 days ago
2009
IEEE
Graph-based semi-supervised learning has gained considerable
interests in the past several years thanks to its effectiveness
in combining labeled and unlabeled data through
labe...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...