Bipartite permutation graphs

Authors:
Jeremy Spinrad;Andreas Brandstädt;Lorna Stewart
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
1987

Citing 8
Cited 18

Permutation Graphs and Transitive Graphs

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Two-dimensional partial orders

Two-dimensional partial orders
Permutation graph structure and algorithms

Permutation graph structure and 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)
An NP-hard problem in bipartite graphs

ACM SIGACT News
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Finding minimum dominating cycles in permutation graphs

Operations Research Letters

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Core and Conditional Core Path of Specified Length in Special Classes of Graphs

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Bandwidth of bipartite permutation graphs in polynomial time

Journal of Discrete Algorithms
On the approximability of average completion time scheduling under precedence constraints

Discrete Applied Mathematics
On the treewidth and pathwidth of biconvex bipartite graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Recognizing bipartite tolerance graphs in linear time

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Bandwidth of bipartite permutation graphs in polynomial time

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On orthogonal ray graphs

Discrete Applied Mathematics
Computing the cutwidth of bipartite permutation graphs in linear time

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
Bandwidth of convex bipartite graphs and related graphs

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Random generation and enumeration of bipartite permutation graphs

Journal of Discrete Algorithms
New exact results and bounds for bipartite crossing numbers of meshes

GD'04 Proceedings of the 12th international conference on Graph Drawing
Efficient algorithms for the longest path problem

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Bandwidth of convex bipartite graphs and related graphs

Information Processing Letters
Computing minimum geodetic sets of proper interval graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An O(n)-time algorithm for the paired domination problem on permutation graphs

European Journal of Combinatorics
On opposition graphs, coalition graphs, and bipartite permutation graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper examines the class of bipartite permutation graphs. Two characterizations of graphs in this class are presented. These characterizations lead to a linear time recognition algorithm, and to polynomial time algorithms for a number of NP-complete problems when restricted to graphs in this class.