Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (Q4606297): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
label / enlabel / en
 
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2016.html#ChatterjeeIP16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2528431921 / rank
 
Normal rank
Property / title
 
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (English)
Property / title: Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (English) / rank
 
Normal rank

Latest revision as of 11:04, 30 July 2024

scientific article; zbMATH DE number 6846399
Language Label Description Also known as
English
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
scientific article; zbMATH DE number 6846399

    Statements

    0 references
    0 references
    0 references
    2 March 2018
    0 references
    graph algorithms
    0 references
    constant-treewidth graphs
    0 references
    reachability queries
    0 references
    distance queries
    0 references
    Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references