213 search results - page 7 / 43 » Regular subgraphs of random graphs |
PVLDB
2010
13 years 6 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
CIAC
2010
Springer
13 years 4 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and