On testing consecutive-ones property in parallel
From MaRDI portal
Publication:1281757
DOI10.1016/S0166-218X(98)00064-XzbMath0936.68111MaRDI QIDQ1281757
Fred S. Annexstein, Ram Swaminathan
Publication date: 18 May 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Recognizing and representing proper interval graphs in parallel using merging and sorting, A note on the consecutive ones submatrix problem.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient parallel algorithm for planarity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A structure theorem for the consecutive 1's property
- Parallel recognition of the consecutive ones property with applications
- An Efficient Parallel Biconnectivity Algorithm
- An Almost Linear-Time Algorithm for Graph Realization
- A Combinatorial Decomposition Theory
- Finding Triconnected Components by Local Replacement
- Dividing a Graph into Triconnected Components
- File organization
- Balanced matrices