Bipartite permutation graphs with application to the minimum buffer size problem
From MaRDI portal
Publication:678867
DOI10.1016/S0166-218X(96)00014-5zbMath0873.68168MaRDI QIDQ678867
Publication date: 9 October 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Queues and service in operations research (90B22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (13)
Labelled well-quasi-order for permutation classes ⋮ Linear structure of bipartite permutation graphs and the longest path problem ⋮ On the OBDD representation of some graph classes ⋮ \(L(0,1)\)-labelling of permutation graphs ⋮ Critical properties of bipartite permutation graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES ⋮ On the complexity of minimum maximal uniquely restricted matching ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Algorithms for maximum internal spanning tree problem for some graph classes ⋮ Algorithm and hardness results on hop domination in graphs
Cites Work
- Unnamed Item
- Bipartite permutation graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A structure theorem for the consecutive 1's property
- Heuristics for join processing using nonclustered indexes
- Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
- Use of graph-theoretic models for optimal relational database accesses to perform join
This page was built for publication: Bipartite permutation graphs with application to the minimum buffer size problem
