2304 search results - page 91 / 461 » On the Vulnerability of Large Graphs |
106
click to vote
DM
2000
15 years 1 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
220
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
ACL
1998
15 years 2 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
104
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
144
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...