Compact I/O-efficient representation of separable graphs and optimal tree layouts

From MaRDI portal
Revision as of 15:14, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2327474

DOI10.1007/978-3-030-14812-6_14OpenAlexW2963817377MaRDI QIDQ2327474

Tomáš Gavenčiak, Jakub Tětek

Publication date: 15 October 2019

Full work available at URL: https://arxiv.org/abs/1811.06749



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).





This page was built for publication: Compact I/O-efficient representation of separable graphs and optimal tree layouts