Transitive-Closure Spanners: A Survey (Q4933368): Difference between revisions

From MaRDI portal
← Older edit
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
ReferenceBot (talk | contribs)
Bots
1,895,659 edits
‎Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1492237614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object location using path separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-preserving data reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information theory in property testing and monotonicity testing in higher dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximate PCPs for multidimensional bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding sparser directed spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive-Closure Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Transitive-Closure Spanners of Low-Dimensional Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4322074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on a free tree via complexity-preserving mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact roundtrip routing in directed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning similarity transformations of linearly ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spot-checkers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of comparisons in property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity testing over general poset domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Provably-Secure Hierarchical Key Assignment Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortcutting Planar Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Shortcutting of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 07:23, 3 July 2024

scientific article; zbMATH DE number 5799057
Language Label Description Also known as
English
Transitive-Closure Spanners: A Survey
scientific article; zbMATH DE number 5799057

    Statements

    title
    Transitive-Closure Spanners: A Survey (English)
    0 references
    publication date
    12 October 2010
    0 references
    cites work
    Q4322074
    0 references
    Q4941829
    0 references
    Q2754183
    0 references
    Spot-checkers
    0 references
    Testing monotonicity
    0 references
    Q4471356
    0 references
    Q3002852
    0 references
    Graph spanners
    0 references
    Q4829021
    0 references
    Q3579388
    0 references
    Q4281646
    0 references
    Q4004146
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C20
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5799057
    0 references
    OpenAlex ID
    W1492237614
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4933368&oldid=35193225"
    Powered by MediaWiki