Combinatorial and computational aspects of graph packing and graph decomposition

Research output: Contribution to journalArticlepeer-review

Abstract

Packing and decomposition of combinatorial objects such as graphs, digraphs, and hypergraphs by smaller objects are central problems in combinatorics and combinatorial optimization. Their study combines probabilistic, combinatorial, and algebraic methods. In addition to being among the most fascinating purely combinatorial problems, they are often motivated by algorithmic applications. There is a considerable number of intriguing fundamental problems and results in this area, and the goal of this paper is to survey the state-of-the-art.

Original languageEnglish
Pages (from-to)12-26
Number of pages15
JournalComputer Science Review
Volume1
Issue number1
DOIs
StatePublished - Aug 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Combinatorial and computational aspects of graph packing and graph decomposition'. Together they form a unique fingerprint.

Cite this