5606 search results - page 136 / 1122 » Randomization Techniques for Graphs. |
COMPSAC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Many efficient random testing algorithms for object-oriented software have been proposed due to their simplicity and reasonable code coverage; however, even the stateof-the-art...
IOLTS
2000
IEEE
14 years 3 months ago
2000
IEEE
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
ICDE
2006
IEEE
15 years 1 days ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
DAM
2008
13 years 10 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
CP
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...