94 search results - page 4 / 19 » On Regular Factors in Regular Graphs with Small Radius |
IWOCA
2009
Springer
15 years 2 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
AAAI
2012
13 years 6 days ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
115
click to vote
ICML
2007
IEEE
15 years 10 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 ...
ALGORITHMICA
2011
14 years 4 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...