Mincut sensitivity data structures for the insertion of an edge (Q2165037): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shiv K. Gupta / rank
Normal rank
 
Property / author
 
Property / author: Shiv K. Gupta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-022-00978-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281566921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic algorithms for Gomory–Hu tree in unweighted graphs / 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: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient strongly connected components algorithm in the fault tolerant model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nearly optimal oracle for avoiding failed vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant additive and \((\mu, \alpha)\)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Connectivity: Connecting to Networks and Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance sensitivity oracles with subcubic preprocessing time and fast query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Spanners for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Gomory-Hu-like Cut Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for Distances Avoiding a Failed Node or Link / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Oracles for Graphs Subject to Vertex Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically switching vertices in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Simple Methods for All Pairs Network Flow Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Simple Fully-Dynamic Cut Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Fault-Tolerant BFS Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Approximate BFS Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of all minimum cuts in a network and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-dynamic min-cut / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:37, 29 July 2024

scientific article
Language Label Description Also known as
English
Mincut sensitivity data structures for the insertion of an edge
scientific article

    Statements

    Mincut sensitivity data structures for the insertion of an edge (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2022
    0 references
    0 references
    mincut
    0 references
    sensitivity
    0 references
    data structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references