Skip to main content
SpringerLink
Log in

Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local approach that covers a graph by small subgraphs, so-called partial star products, and then utilizes this information to derive the global factors and an embedding of the graph under investigation into Cartesian product graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aurenhammer F., Hagauer J., Imrich W.: Cartesian graph factorization at logarithmic cost per edge. Comput. Complex. 2, 331–349 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chiba N., Nishizeki T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Feigenbaum, J.: Product graphs: some algorithmic and combinatorial results. Technical Report STAN-CS-86-1121, Stanford University, Computer Science, PhD Thesis (1986)

  4. Feigenbaum J., Haddad R.A.: On factorable extensions and subgraphs of prime graphs. SIAM J. Discrete Math. 2, 197–218 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Feigenbaum J., Hershberger J., Schäffer A.A.: A polynomial time algorithm for finding the prime factors of Cartesian-product graphs. Discrete Appl. Math. 12, 123–138 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Graham R.L., Winkler P.M.: On isometric embeddings of graphs. Trans. Am. Math. Soc. 288(2), 527–536 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hagauer J., Žerovnik J.: An algorithm for the weak reconstruction of Cartesian-product graphs. J. Combin. Inf. Syst. Sci. 24, 97–103 (1999)

    Google Scholar 

  8. Hammack R., Imrich W., Klavžar S.: Handbook of Product Graphs. Discrete Mathematics and its Applications 2nd edn. CRC Press, Boca Raton (2011)

    Google Scholar 

  9. Hellmuth M.: A local prime factor decomposition algorithm. Discrete Math. 311(12), 944–965 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hellmuth M., Imrich W., Klöckl W., Stadler P.F.: Approximate graph products. Eur. J. Combin. 30, 1119–1133 (2009)

    Article  MATH  Google Scholar 

  11. Hellmuth M., Imrich W., Klöckl W., Stadler P.F.: Local algorithms for the prime factorization of strong product graphs. Math. Comput. Sci. 2(4), 653–682 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hellmuth, M., Ostermeier, L., Stadler, P.F.: Unique square property, equitable partitions, and product-like graphs. Discrete Math. (2013, submitted). http://arxiv.org/abs/1301.6898

  13. Imrich W., Klavžar S.: Product graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)

    Google Scholar 

  14. Imrich W., Klavžar S., Rall F.D.: Topics in Graph Theory: Graphs and Their Cartesian Product. AK Peters Ltd., Wellesley (2008)

    Google Scholar 

  15. Imrich W., Peterin I.: Recognizing Cartesian products in linear time. Discrete Math. 307(3–5), 472–483 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Imrich W., Pisanski T., Žerovnik J.: Recognizing Cartesian graph bundles. Discrete Math. 167–168, 393–403 (1997)

    Article  Google Scholar 

  17. Imrich W., Žerovnik J.: On the weak reconstruction of Cartesian-product graphs. Discrete Math. 150(1–3), 167–178 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Imrich W., Žerovnik J.: Factoring Cartesian-product graphs. J. Graph Theory 18, 557–567 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. Imrich, W., Zmazek, B., Žerovnik, J.: Weak k-reconstruction of Cartesian product graphs. Electron. Notes Discrete Math. 10, 297–300 (2001). Comb01, Euroconference on Combinatorics, Graph Theory and Applications

  20. Sabidussi G.: Graph multiplication. Math. Z. 72, 446–457 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  21. Žerovnik J.: On recognition of strong graph bundles. Math. Slovaca 50, 289–301 (2000)

    MathSciNet  MATH  Google Scholar 

  22. Zmazek B., Žerovnik J.: Algorithm for recognizing Cartesian graph bundles. Discrete Appl. Math. 120, 275–302 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zmazek B., Žerovnik J.: Weak reconstruction of strong product graphs. Discrete Math. 307, 641–649 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Bioinformatics, Saarland University, Building E2.1, Room 413, P.O. Box 15 11 50, 66041, Saarbrücken, Germany

    Marc Hellmuth

  2. Chair of Applied Mathematics, Montanuniversität, 8700, Leoben, Austria

    Wilfried Imrich & Tomas Kupka

  3. Department of Applied Mathematics, VSB-Technical University of Ostrava, 17, listopadu 15/2172, 70833, Ostrava, Czech Republic

    Tomas Kupka

Authors
  1. Marc Hellmuth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wilfried Imrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomas Kupka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marc Hellmuth.

Additional information

We wish to thank Lydia Ostermeier and the referees for their very well posed remarks and suggestions. This work was financed in part by ARRS Slovenia and the Deutsche Forschungsgemeinschaft (DFG) within the EUROCORES Programme EuroGIGA (project GReGAS) of the European Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hellmuth, M., Imrich, W. & Kupka, T. Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. Math.Comput.Sci. 7, 255–273 (2013). https://doi.org/10.1007/s11786-013-0156-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-013-0156-7

Keywords

Mathematics Subject Classification (2010)

Search

Navigation