[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Factorization of Cartesian Products of Hypergraphs

  • Conference paper
Computing and Combinatorics (COCOON 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6196))

Included in the following conference series:

Abstract

In this article we present the L2-section, a tool used to represent a hypergraph in terms of an “advanced graph” and results leading to first algorithm, in O(nm), for a bounded-rank, bounded-degree hypergraph H, which factorizes H in prime factors. The paper puts a premium on the characterization of the prime factors of a hypergraph, by exploiting isomorphisms between the layers in the 2-section, as returned by a standard graph factorization algorithm, such as the one designed by Imrich and Peterin.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berge, C.: Hypergraphs. North Holland, Amsterdam (1989)

    MATH  Google Scholar 

  2. Bretto, A.: Introduction to hypergraph theory and its use in engineering and image processing. Advances in imaging and electron physics 131 (2004)

    Google Scholar 

  3. Bretto, A.: Hypergraphs and the helly property. Ars Combinatoria 78, 23–32 (2006)

    MATH  MathSciNet  Google Scholar 

  4. Imrich, W., Klavžar, S., Rall, D.F.: Topics in graph theory. Graphs and their Cartesian product. A K Peters, Wellesley (2008)

    MATH  Google Scholar 

  5. Imrich, W., Peterin, I.: Recognizing cartesian products in linear time. Discrete Mathematics 307, 472–483 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Imrich, W., Pisanski, T., Žerovnik, J.: Recognizing cartesian graph bundles. Discrete Mathematics 167-168, 393–403 (1997)

    Article  MathSciNet  Google Scholar 

  7. Peterin, I.: Game chromatic number of cartesian product graphs. Electronic Notes in Discrete Mathematics 29, 353–357 (2007)

    Article  Google Scholar 

  8. Sabidussi, G.: Graph multiplication. Mathematische Zeitschrift 72 (1960)

    Google Scholar 

  9. Vesel, A.: Channel assignment with separation in the cartesian product of two cycles. In: Proceedings of the 24th International Conference on Information Technology Interfaces (2002)

    Google Scholar 

  10. Vizing, V.G.: The cartesian product of graphs. Vycisl. Sistemy 9, 30–43 (1963)

    MathSciNet  Google Scholar 

  11. Zhang, Y., Sun, X.: The antimagicness of the cartesian product of graphs. Theor. Comput. Sci. 410(8-10), 727–735 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bretto, A., Silvestre, Y. (2010). Factorization of Cartesian Products of Hypergraphs. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14031-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14030-3

  • Online ISBN: 978-3-642-14031-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics