Structured Connectivity Augmentation (Q4555048): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128944013, #quickstatements; #temporary_batch_1723710233280
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1706.04255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence free graphs and vertex connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal vertex-connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detachments Preserving Local Edge-Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact characterization of tractable demand patterns for maximum disjoint path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum block containing a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128944013 / rank
 
Normal rank

Latest revision as of 09:45, 15 August 2024

scientific article; zbMATH DE number 6981151
Language Label Description Also known as
English
Structured Connectivity Augmentation
scientific article; zbMATH DE number 6981151

    Statements

    Structured Connectivity Augmentation (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2018
    0 references
    connectivity augmentation
    0 references
    graph superposition
    0 references
    complexity
    0 references

    Identifiers

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