Bipartite permutation graphs with application to the minimum buffer size problem
type: Item
instance of: scholarly article
title: Bipartite permutation graphs with application to the minimum buffer size problem
zbMATH Open document ID: 0873.68168
DOI: 10.1016/S0166-218X(96)00014-5
author: Ten H. Lai
author: Shu-Shang Wei
published in: Discrete Applied Mathematics
publication date: 1997-10-09T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1004428
zbMATH Keywords: bipartite permutation graphs
zbMATH Keywords: relational database systems
MaRDI profile type: Publication
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q3328583
cites work: Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
cites work: Heuristics for join processing using nonclustered indexes
cites work: Use of graph-theoretic models for optimal relational database accesses to perform join
cites work: Bipartite permutation graphs
cites work: A structure theorem for the consecutive 1's property
description: scientific article; zbMATH DE number 1004428