Block graphs in practice
From MaRDI portal
Publication:2363994
Recommendations
- Block graph of a graph
- An observation on block graphs
- A characterization of block graphs
- Blocks in \(k\)-connected graphs
- On the block number of graphs
- Graphs obtained from collections of blocks
- A Characterization of Block-Graphs
- scientific article; zbMATH DE number 3891428
- On mixed block graphs
- Block graphs of maximum Kirchhoff index
Cites work
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Data structure lower bounds on random access to grammar-compressed strings
- Faster approximate pattern matching in compressed repetitive texts
- On compressing and indexing repetitive sequences
- Practical entropy-compressed rank/select dictionary
- Random access to grammar-compressed strings
- Random access to high-order entropy compressed text
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- The Smallest Grammar Problem
Cited in
(3)
This page was built for publication: Block graphs in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363994)