Intractability of min- and max-cut in streaming graphs (Q1944060): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060383163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification in the Semi-streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithm for graph spanners-single pass and constant processing time per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding common neighborhoods in massive graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid approach to finding edge connectivity and packing arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating Path Aggregates over Streaming Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal per-edge processing times in the semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Matching in the Semi-Streaming Model / rank
 
Normal rank

Latest revision as of 07:37, 6 July 2024

scientific article
Language Label Description Also known as
English
Intractability of min- and max-cut in streaming graphs
scientific article

    Statements

    Intractability of min- and max-cut in streaming graphs (English)
    0 references
    0 references
    4 April 2013
    0 references
    graph algorithms
    0 references
    streaming algorithms
    0 references
    intractability
    0 references
    minimum cut
    0 references
    min-cut
    0 references
    maximum cut
    0 references
    max-cut
    0 references

    Identifiers