Complexity and algorithms for constant diameter augmentation problems (Q2072060): 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: W3164510505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers for the stability number and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital nodes with respect to independent set and vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3109939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking optimal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small diameter after edge deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter bounds for altered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the missing Moore graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction and deletion blockers for perfect graphs and \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting graphs to minimize the diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parametric complexity of graph diameter augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a Bipartite Graph by Contracting Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting forests to meet odd diameter requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex blocker clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum edge blocker dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is No Irregular Moore Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank

Latest revision as of 21:04, 27 July 2024

scientific article
Language Label Description Also known as
English
Complexity and algorithms for constant diameter augmentation problems
scientific article

    Statements

    Complexity and algorithms for constant diameter augmentation problems (English)
    0 references
    0 references
    1 February 2022
    0 references
    graph diameter
    0 references
    blocker problem
    0 references
    polynomial algorithm
    0 references
    NP-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers