Canonical data structure for interval probe graphs
From MaRDI portal
Recommendations
- Succinct data structures for families of interval graphs
- Interval graphs: canonical representations in logspace
- Interval graphs: canonical representation in logspace
- On probe interval graphs
- Characterizing interval graphs which are probe unit interval graphs
- A polynomial time recognition algorithm for probe interval graphs
- Adjacency matrices of probe interval graphs
- A dynamic distributed approach to representing proper interval graphs
Cited in
(3)
This page was built for publication: Canonical data structure for interval probe graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712172)