1420 search results - page 33 / 284 » Representation of Graphs by OBDDs |
194
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
165
click to vote
EUROMICRO
1996
IEEE
15 years 10 months ago
1996
IEEE
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
182
click to vote
JAPLL
2006
15 years 6 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
138
click to vote
IJON
2010
15 years 4 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...