Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Local Algorithms for the Prime Factorization of Strong Product Graphs

Local Algorithms for the Prime Factorization of Strong Product Graphs The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant “approximate” prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this information to derive global factors. We present here a local, quasi-linear algorithm for the prime factorization of “locally unrefined” graphs with respect to the strong product. To this end we introduce the backbone $$\mathbb{B} (G)$$ for a given graph G and show that the neighborhoods of the backbone vertices provide enough information to determine the global prime factors. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

Local Algorithms for the Prime Factorization of Strong Product Graphs

Loading next page...
 
/lp/springer-journals/local-algorithms-for-the-prime-factorization-of-strong-product-graphs-bpDKCok920

References (18)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Birkhäuser Verlag Basel/Switzerland
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-009-0073-y
Publisher site
See Article on Publisher Site

Abstract

The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant “approximate” prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this information to derive global factors. We present here a local, quasi-linear algorithm for the prime factorization of “locally unrefined” graphs with respect to the strong product. To this end we introduce the backbone $$\mathbb{B} (G)$$ for a given graph G and show that the neighborhoods of the backbone vertices provide enough information to determine the global prime factors.

Journal

Mathematics in Computer ScienceSpringer Journals

Published: Dec 7, 2009

There are no references for this article.