941 search results - page 11 / 189 » Efficient Testing of Large Graphs |
SIGSOFT
2004
ACM
15 years 10 months ago
2004
ACM
When software is modified, during development and maintenance, it is regression tested to provide confidence that the changes did not introduce unexpected errors and that new feat...
66
Voted
AAAI
2008
14 years 12 months ago
2008
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
80
Voted
RELMICS
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
102
click to vote
SIGMOD
2012
ACM
13 years 2 days ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...