Partitioning a graph into small pieces with applications to path transversal
Author:
- 9 March 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 177 (1-2) , 1-19
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Division of Computing and Communication Foundations (1115525)
This publication has 29 references indexed in Scilit:
- On the Computational Complexity of Vertex Integrity and Component Order ConnectivityAlgorithmica, 2016
- The $k$ k -separator problem: polyhedra, complexity and approximation resultsJournal of Combinatorial Optimization, 2014
- On the vertex -path coverDiscrete Applied Mathematics, 2013
- Fixed-Parameter and Approximation Algorithms: A New Look2013
- Minimum -path vertex coverDiscrete Applied Mathematics, 2011
- Detecting high log-densities2010
- Expander flows, geometric embeddings and graph partitioningJournal of the ACM, 2009
- Balanced Graph PartitioningTheory of Computing Systems, 2006
- Approximation Algorithms for the 0-Extension ProblemSIAM Journal on Computing, 2005
- A new multilayered PCP and the hardness of hypergraph vertex cover2003