Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees (Q4202205): 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.1137/0222033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041200781 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:55, 19 March 2024

scientific article; zbMATH DE number 404438
Language Label Description Also known as
English
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
scientific article; zbMATH DE number 404438

    Statements

    Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees (English)
    0 references
    0 references
    0 references
    0 references
    1 September 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear-processor NC algorithms
    0 references
    strong connectivity
    0 references
    planar directed graphs
    0 references
    planar orientation
    0 references
    vertex expansion
    0 references
    vertex contraction
    0 references
    edge cutting
    0 references
    tree rerooting
    0 references
    duplicate removal
    0 references
    directed spanning trees
    0 references
    0 references