On testing consecutive-ones property in parallel
From MaRDI portal
Publication:1281757
DOI10.1016/S0166-218X(98)00064-XzbMath0936.68111OpenAlexW2053714567MaRDI QIDQ1281757
Ram Swaminathan, Fred S. Annexstein
Publication date: 18 May 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00064-x
Related Items (5)
2-nested matrices: towards understanding the structure of circle graphs ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Recognizing and representing proper interval graphs in parallel using merging and sorting ⋮ Optimal rates of statistical seriation ⋮ 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
This page was built for publication: On testing consecutive-ones property in parallel