article · 2008

Complexity of Graph Partition Problems

Tomas Feder , Pavol Hell , Sulamita Klein , Rajeev Motwani

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

APA 7

Tomas Feder, P. H. S. K. R. M. (2008). Complexity of Graph Partition Problems.

MLA 9

Tomas Feder, Pavol Hell , Sulamita Klein , Rajeev Motwani. “Complexity of Graph Partition Problems.” 2008.

Chicago

Tomas Feder, Pavol Hell , Sulamita Klein , Rajeev Motwani. 2008. “Complexity of Graph Partition Problems.”

Harvard

Tomas Feder, P.H.S.K.R.M. (2008) ‘Complexity of Graph Partition Problems’.

BibTeX

@article{tomasfeder2008complexity,
  title = {{Complexity of Graph Partition Problems}},
  author = {Tomas Feder, Pavol Hell , Sulamita Klein , Rajeev Motwani},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.