On the treewidth and pathwidth of biconvex bipartite graphs

Authors:
Sheng-Lung Peng;Yi-Chuan Yang
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 14
Cited 3

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
Treewidth of Circular-Arc Graphs

SIAM Journal on Discrete Mathematics
Treewidth of chordal bipartite graphs

Journal of Algorithms
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Biconvex graphs: ordering and algorithms

Discrete Applied Mathematics
Treewidth of Circle Graphs

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Dominoes

WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Bipartite permutation graphs

Discrete Applied Mathematics
Computing treewidth and minimum fill-in for permutation graphs in linear time

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Edge search number of cographs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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 GL 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.