Sparse reliable graph backbones (Q418121): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2011.10.007 / rank
Normal rank
 
Property / author
 
Property / author: David Peleg / rank
Normal rank
 
Property / author
 
Property / author: David Peleg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6038285 / rank
 
Normal rank
Property / zbMATH Keywords
 
network reliability
Property / zbMATH Keywords: network reliability / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse subgraphs
Property / zbMATH Keywords: sparse subgraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
tutte polynomial
Property / zbMATH Keywords: tutte polynomial / 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.1016/j.ic.2011.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034942944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-ramanujan sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Sampling in Cut, Flow, and Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2011.10.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Sparse reliable graph backbones
scientific article

    Statements

    Sparse reliable graph backbones (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2012
    0 references
    network reliability
    0 references
    sparse subgraphs
    0 references
    tutte polynomial
    0 references

    Identifiers

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