Discrete Applied Mathematics
Hamiltonian circuits in chordal bipartite graphs
Discrete Mathematics
Bipartite permutation graphs with application to the minimum buffer size problem
Discrete Applied Mathematics
Graph classes: a survey
Information Processing Letters
Introduction to Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics
| Hi-index | 0.89 |
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note. The decomposition gives a linear structure of bipartite permutation graphs, and it can be obtained in O(n) time, where n is the number of vertices. As an application of the decomposition, we show an O(n) time and space algorithm for finding a longest path in a bipartite permutation graph.