3 years ago

On the 1-factorizations of Middle Level Graph: Inner structure, Algorithm, and Application.

Kai Jin

In this paper, we revisit the lexical and modular factorization of the middle level graph. We provide new and simple definitions, prove new properties and formulas, and design optimum algorithms for computing these factorizations. In addition, we provide interesting applications of these factorizations in some hat-guessing type games.

Publisher URL: http://arxiv.org/abs/1704.08852

DOI: arXiv:1704.08852v2

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.