The complexity of tree partitioning

Zhao An; Qilong Feng; Iyad Kanj; Ge Xia

doi:10.1007/978-3-319-62127-2_4

The complexity of tree partitioning

Zhao An
, Qilong Feng
, Iyad Kanj
, Ge Xia

Central South University
Lafayette College

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings
Editors	Faith Ellen, Antonina Kolokolova, Jorg-Rudiger Sack
Publisher	Springer Verlag
Pages	37-48
Number of pages	12
ISBN (Print)	9783319621265
DOIs	https://doi.org/10.1007/978-3-319-62127-2_4
State	Published - 2017
Event	15th International Symposium on Algorithms and Data Structures, WADS 2017 - St. John’s, Canada Duration: Jul 31 2017 → Aug 2 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10389 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Symposium on Algorithms and Data Structures, WADS 2017
Country/Territory	Canada
City	St. John’s
Period	7/31/17 → 8/2/17

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-62127-2_4

Cite this

An, Z., Feng, Q., Kanj, I., & Xia, G. (2017). The complexity of tree partitioning. In F. Ellen, A. Kolokolova, & J.-R. Sack (Eds.), Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings (pp. 37-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_4

The complexity of tree partitioning. / An, Zhao; Feng, Qilong; Kanj, Iyad et al.
Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. ed. / Faith Ellen; Antonina Kolokolova; Jorg-Rudiger Sack. Springer Verlag, 2017. p. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

An, Z, Feng, Q, Kanj, I & Xia, G 2017, The complexity of tree partitioning. in F Ellen, A Kolokolova & J-R Sack (eds), Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10389 LNCS, Springer Verlag, pp. 37-48, 15th International Symposium on Algorithms and Data Structures, WADS 2017, St. John’s, Canada, 7/31/17. https://doi.org/10.1007/978-3-319-62127-2_4

An Z, Feng Q, Kanj I, Xia G. The complexity of tree partitioning. In Ellen F, Kolokolova A, Sack JR, editors, Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Springer Verlag. 2017. p. 37-48. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-62127-2_4

An, Zhao ; Feng, Qilong ; Kanj, Iyad et al. / The complexity of tree partitioning. Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. editor / Faith Ellen ; Antonina Kolokolova ; Jorg-Rudiger Sack. Springer Verlag, 2017. pp. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5d66c3d4f62346babdca4be09ef44313,

title = "The complexity of tree partitioning",

author = "Zhao An and Qilong Feng and Iyad Kanj and Ge Xia",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 15th International Symposium on Algorithms and Data Structures, WADS 2017 ; Conference date: 31-07-2017 Through 02-08-2017",

year = "2017",

doi = "10.1007/978-3-319-62127-2\_4",

language = "English",

isbn = "9783319621265",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "37--48",

editor = "Faith Ellen and Antonina Kolokolova and Jorg-Rudiger Sack",

booktitle = "Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings",

}

TY - GEN

T1 - The complexity of tree partitioning

AU - An, Zhao

AU - Feng, Qilong

AU - Kanj, Iyad

AU - Xia, Ge

N1 - Publisher Copyright: © Springer International Publishing AG 2017.

PY - 2017

Y1 - 2017

UR - https://www.scopus.com/pages/publications/85025124184

UR - https://www.scopus.com/pages/publications/85025124184#tab=citedBy

U2 - 10.1007/978-3-319-62127-2_4

DO - 10.1007/978-3-319-62127-2_4

M3 - Conference contribution

AN - SCOPUS:85025124184

SN - 9783319621265

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 37

EP - 48

BT - Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings

A2 - Ellen, Faith

A2 - Kolokolova, Antonina

A2 - Sack, Jorg-Rudiger

PB - Springer Verlag

T2 - 15th International Symposium on Algorithms and Data Structures, WADS 2017

Y2 - 31 July 2017 through 2 August 2017

ER -

The complexity of tree partitioning

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this