Augmenting forests to meet odd diameter requirements (Q2506822): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2005.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150008165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing the diameter of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting trees to meet biconnectivity and diameter constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to decrease the diameter of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472504 / 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: Graph connectivity and its augmentation: Applications of MA orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank

Latest revision as of 20:31, 24 June 2024

scientific article
Language Label Description Also known as
English
Augmenting forests to meet odd diameter requirements
scientific article

    Statements

    Augmenting forests to meet odd diameter requirements (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2006
    0 references
    undirected graph
    0 references
    graph augmentation problem
    0 references
    diameter
    0 references
    forest
    0 references
    approximation algorithm
    0 references

    Identifiers

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