scientific article; zbMATH DE number 2079399
From MaRDI portal
Publication:4471358
Recommendations
Cited in
(34)- Geometric inhomogeneous random graphs
- Compact graphings
- Compact structure for sparse undirected graphs based on a clique graph partition
- Compact I/O-efficient representation of separable graphs and optimal tree layouts
- Succinct representation of labeled graphs
- GLOUDS: representing tree-like graphs
- Succinct encoding of binary strings representing triangulations
- Compact representation of graphs with bounded bandwidth or treedepth
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Compact navigation and distance oracles for graphs with small treewidth
- Building knowledge maps of web graphs
- Efficient Compression of Web Graphs
- Succinct Representations of Arbitrary Graphs
- Succinct representations of separable graphs
- Succinct encoding of arbitrary graphs
- Compactifying exchange graphs. I: Annuli and tubes
- scientific article; zbMATH DE number 1262796 (Why is no real title available?)
- Compact navigation and distance oracles for graphs with small treewidth
- Some typical properties of the spatial preferred attachment model
- Dynamic effective resistances and approximate Schur complement on separable graphs
- Complexity and polynomially solvable special cases of QUBO
- Succinct data structures for chordal graphs
- Indexing graph search trees and applications
- Sampling geometric inhomogeneous random graphs in linear time
- I/O-efficient path traversal in succinct planar graphs
- A Geometric Preferential Attachment Model of Networks II
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Space-efficient graph coarsening with applications to succinct planar encodings
- Succinct planar encoding with minor operations
- Compact representation of graphs of small clique-width
- Trading uninitialized space for time
- Graph compression and the zeros of polynomials
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471358)
