Abstract
In this paper we explore the biclique structure of a biconvex bipartite graph G. We define two concatenation operators on bicliques of G. According to these operations, we show that G can be decomposed into two chain graphs G L and GR, and a bipartite permutation graph GP. Using this representation, we propose linear-time algorithms for the treewidth and pathwidth problems on biconvex bipartite graphs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Peng, S. L., & Yang, Y. C. (2007). On the treewidth and pathwidth of biconvex bipartite graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 244–255). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
