Covering Graphs with Few Complete Bipartite Subgraphs

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
January 2007
bib DOI

Abstract

Full Citation:

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider. Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag.

Type
Conference Paper
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.