Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Approximate Counting of k-Paths: Deterministic and in Polynomial Space
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ICALP.2019.24 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Balanced Hashing, Color Coding and Approximate Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced families of perfect hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time- and space-optimal algorithm for the many-visits TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Sums for Undirected Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths and Packings in Halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow sieves for parameterized paths and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spotting Trees with Few Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensor-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms are a good basis for counting small subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm engineering for color-coding with applications to signaling pathway detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIMITS and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar k-Path in Subexponential Time and Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving space by algebraization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative families: a unified tradeoff-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, Minimizing, and Counting Weighted Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Color Coding-Related Techniques / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10600/pdf/LIPIcs-ICALP-2019-24.pdf / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965200911 / rank
 
Normal rank
Property / title
 
Approximate Counting of k-Paths: Deterministic and in Polynomial Space (English)
Property / title: Approximate Counting of k-Paths: Deterministic and in Polynomial Space (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ICALP.2019.24 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561517
Language Label Description Also known as
English
Approximate Counting of k-Paths: Deterministic and in Polynomial Space
scientific article; zbMATH DE number 7561517

    Statements

    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    parameterized complexity
    0 references
    approximate counting
    0 references
    \(k\)-path
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Approximate Counting of k-Paths: Deterministic and in Polynomial Space (English)
    0 references

    Identifiers