Linear structure of bipartite permutation graphs and the longest path problem

Information Processing Letters

Volumn 103, Issue 2, 2007, Pages 71-77

  Uehara, Ryuhei ^a   Valiente, Gabriel ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Bipartite permutation graphs; Graph algorithms; Graph decomposition; Linear time algorithms

Indexed keywords

ALGORITHMS; MOTION PLANNING; PROBLEM SOLVING;

BIPARTITE PERMUTATION GRAPHS; GRAPH DECOMPOSITION; LINEAR TIME ALGORITHMS;

GRAPH THEORY;

EID: 34247489118     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.02.010     Document Type: Article

References (14)

1. Asano T., Evans P., Uehara R., and Valiente G. Site consistency in phylogenetic networks with recombination. In: Iliopoulos C.S., Park K., and Steinhöfel K. (Eds). Algorithms in Bioinformatics (2006), College Publications 15-26 (Chapter 2)
2. Brandstädt A., Le V.B., and Spinrad J.P. Graph Classes: A Survey (1999), SIAM
3. Brandstädt A., and Lozin V.V. On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria 67 1 (2003) 273-281
4. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), Cambridge
5. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics. second ed. vol. 57 (2004), Elsevier
6. Karger D.R., Motwani R., and Ramkumar G.D.S. On approximating the longest path in a graph. Algorithmica 18 1 (1997) 82-98
7. Kloks T., Kratsch D., and Müller H. Bandwidth of chain graphs. Information Processing Letters 68 6 (1998) 313-315
8. Lai T.-H., and Wei S.-S. Bipartite permutation graphs with application to the minimum buffer size problem. Discrete Mathematics 74 1 (1997) 33-55
9. Lipski W., and Preparata F.P. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15 4 (1981) 329-346
10. Müller H. Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics 156 1 (1996) 291-298
11. Spinrad J.P. Efficient Graph Representations (2003), American Mathematical Society
12. Spinrad J.P., Brandstädt A., and Stewart L. Bipartite permutation graphs. Discrete Applied Mathematics 18 3 (1987) 279-292
13. Uehara R., and Uno Y. Efficient algorithms for the longest path problem. Proc. 15th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 3341 (2004), Springer-Verlag 871-883
14. Yannakakis M. Node-deletion problems on bipartite graphs. SIAM Journal on Computing 10 2 (1981) 310-327