On the Parameterized Complexity of Computing Balanced Partitions in Graphs
Crossref DOI link: https://doi.org/10.1007/s00224-014-9557-5
Published Online: 2014-07-08
Published Print: 2015-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
van Bevern, René
Feldmann, Andreas Emil
Sorge, Manuel
Suchý, Ondřej
Text and Data Mining valid from 2014-07-08