Published in

Springer Verlag, Lecture Notes in Computer Science, p. 76-87

DOI: 10.1007/978-3-642-45043-3_8

Links

Tools

Export citation

Search in Google Scholar

On the Parameterized Complexity of Computing Graph Bisections

Proceedings article published in 2013 by René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO