A selected tour of the theory of identification matrices
From MaRDI portal
Publication:1575436
DOI10.1016/S0304-3975(99)00236-4zbMath0945.68141MaRDI QIDQ1575436
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Efficient parallel recognition of some circular arc graphs. II
- Matrix multiplication via arithmetic progressions
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- A new upper bound on the complexity of the all pairs shortest path problem
- Efficient parallel recognition of some circular arc graphs. I
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Matrix characterizations of circular-arc graphs
- Parallel recognition of the consecutive ones property with applications
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
- Efficient parallel algorithms for bipartite permutation graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
