Steiner Transitive-Closure Spanners of Low-Dimensional Posets

DOI10.1007/978-3-642-22006-7_64zbMath1333.68203OpenAlexW1487363550MaRDI QIDQ3012848

Grigory Yaroslavtsev, Arnab Bhattacharyya, Piotr Berman, Elena Grigorescu, David P. Woodruff, Sofya Raskhodnikova

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_64

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Steiner transitive-closure spanners of low-dimensional posets ⋮ Transitive-Closure Spanners: A Survey

Cites Work

• Unnamed Item
• Property-preserving data reconstruction
• New constructions for provably-secure time-bound hierarchical key assignment schemes
• Unbounded fan-in circuits and associative functions
• The Complexity of the Partial Order Dimension Problem
• Graph spanners
• Transitive-Closure Spanners
• Transitive-Closure Spanners: A Survey
• Local Monotonicity Reconstruction
• Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
• Concerning similarity transformations of linearly ordered sets
• Partially Ordered Sets
• Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners

This page was built for publication: Steiner Transitive-Closure Spanners of Low-Dimensional Posets