Skip to Content
Toggle navigation
Log in
About
Help
Contact
Advanced Search
Search LDR
Go
Home
The complexity of tree...
The complexity of tree partitioning
Downloadable Content
Download this item
Additional options
Export
Download file and all metadata formats (as .zip)
Metadata
View metadata as CSV
View metadata as TTL
View metadata as NTriples
View metadata as JSON-LD
Title
The complexity of tree partitioning
Creator
An, Z.
Kanj, I.
Feng, Q.
Xia, Ge
Source
Algorithms and Data Structures
Academic Department
Computer Science
Division
Natural Sciences
Organization
Lafayette College
Date Issued
2017
Date Available
2018-06-21T14:44:08Z
Type
Part of Book
Language
English
Bibliographic Citation
An, Z., et al. (2017) "The complexity of tree partitioning." In F. Ellen, A. Kolokolova, J. R. Sack (eds.), Algorithms and Data Structures (pp. 37-48). Cham: Springer.
Standard Identifier
DOI
10.1007/978-3-319-62127-2_4
Handle
10385/2412
Permalink
http://hdl.handle.net/10385/2412
Rights Statement
In Copyright
Rights Holders
Springer International Publishing AG
Contains
File
Xia-AlgorithmsandDataStructures-2017.pdf
Uploaded 2019-10-20
Public
Download
Member of Collection
Faculty Publications
View Collection