Compact representation of graphs with bounded bandwidth or treedepth
From MaRDI portal
Publication:2672250
DOI10.1016/j.ic.2022.104867zbMath1504.68168OpenAlexW4206998859MaRDI QIDQ2672250
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104867
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct encoding of arbitrary graphs
- Thue choosability of trees
- Bandwidth of convex bipartite graphs and related graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Counting unlabeled bipartite graphs using Polya's theorem
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Compact representation of graphs of small clique-width
- Graph minors. III. Planar tree-width
- On low tree-depth decompositions
- The NP-completeness of the bandwidth minimization problem
- Finding minimum height elimination trees for interval graphs in polynomial time
- Efficient graph representations
- Approximating the bandwidth via volume respecting embeddings
- Short encodings of planar graphs and maps
- Optimal node ranking of tree in linear time
- Nonrepetitive graph colouring
- Tree-depth, subgraph coloring and homomorphism bounds
- On an elementary proof of some asymptotic formulas in the theory of partitions
- Succinct encodings for families of interval graphs
- Fully Functional Static and Dynamic Succinct Trees
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Succinct Representations of Separable Graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
- On bandwidth, cutwidth, and quotient graphs
- Rankings of Graphs
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Optimal Assignments of Numbers to Vertices
- Experimental and Efficient Algorithms
This page was built for publication: Compact representation of graphs with bounded bandwidth or treedepth
