Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (Q3652304): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Yang Kao / rank
Normal rank
 
Property / author
 
Property / author: Ming-Yang Kao / 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.1007/978-3-642-10631-6_120 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119377188 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:06, 20 March 2024

scientific article
Language Label Description Also known as
English
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
scientific article

    Statements

    Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2009
    0 references
    0 references
    two-vertex connectivity augmentation problem
    0 references
    linear time algorithm
    0 references
    0 references