42 search results - page 4 / 9 » Small subgraphs of random regular graphs |
JGAA
2007
13 years 6 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
JCO
2010
13 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
CMOT
2004
13 years 6 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
RSA
2011
13 years 1 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...