2304 search results - page 212 / 461 » On the Vulnerability of Large Graphs |
172
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
164
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
214
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
206
click to vote
FM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...