Linear-time parameterized algorithms with limited local resources (Q2105436): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pregel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3010618012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Parameterized Problems and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of parameterized streaming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Streaming: Maximal Matching and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Linear-Time Data Reduction for Maximum Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank

Latest revision as of 01:55, 31 July 2024

scientific article
Language Label Description Also known as
English
Linear-time parameterized algorithms with limited local resources
scientific article

    Statements

    Linear-time parameterized algorithms with limited local resources (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    bigdata
    0 references
    linear-time algorithm
    0 references
    space complexity
    0 references
    graph matching
    0 references

    Identifiers