Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/jgt.21719 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148734039 / 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: Improved approximability and non-approximability results for graph diameter decreasing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed covering of trees and the augmentation problem with odd diameter constraints / 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: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / 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: Q4448760 / 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: 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 minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Augmenting Outerplanar Graphs to Meet Diameter Requirements
scientific article

    Statements

    Augmenting Outerplanar Graphs to Meet Diameter Requirements (English)
    0 references
    0 references
    15 November 2013
    0 references
    undirected graph
    0 references
    graph augmentation problem
    0 references
    diameter
    0 references
    outerplanar graphs
    0 references
    partial 2-trees
    0 references
    constant factor approximation algorithm
    0 references

    Identifiers

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