skip to content
A generalization of Tarjan's depth first search algorithm for the biconnectivity problem Preview this item
ClosePreview this item
Checking...

A generalization of Tarjan's depth first search algorithm for the biconnectivity problem

Author: Yung Hyang Tsin; University of Alberta. Department of Computing Science.
Publisher: Edmonton : Dept. of Computing Science, University of Alberta, 1982.
Series: Technical report (University of Alberta. Department of Computing Science), TR82-2.
Edition/Format:   Print book : English : 1st draft, Apr. 1982
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Named Person: Robert E Tarjan
Document Type: Book
All Authors / Contributors: Yung Hyang Tsin; University of Alberta. Department of Computing Science.
OCLC Number: 15951819
Description: 15 pages : illustrations ; 28 cm.
Series Title: Technical report (University of Alberta. Department of Computing Science), TR82-2.
Responsibility: Yung H. Tsin.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/15951819> # A generalization of Tarjan's depth first search algorithm for the biconnectivity problem
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "15951819" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/10850370#Place/edmonton> ; # Edmonton
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/abc> ;
    schema:about <http://viaf.org/viaf/73933029> ; # Robert Endre Tarjan
    schema:about <http://id.loc.gov/authorities/subjects/sh85056471> ; # Graph theory
    schema:about <http://id.worldcat.org/fast/946584> ; # Graph theory
    schema:about <http://id.worldcat.org/fast/1156136> ; # Trees (Graph theory)
    schema:about <http://dewey.info/class/510/e19/> ;
    schema:bookEdition "1st draft, Apr. 1982." ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/152390057> ; # University of Alberta. Department of Computing Science.
    schema:creator <http://viaf.org/viaf/104436570> ; # Yung Hyang Tsin
    schema:datePublished "1982" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/10850370> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/10850370#Series/technical_report_university_of_alberta_department_of_computing_science> ; # Technical report (University of Alberta. Department of Computing Science) ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/10850370#Series/technical_report> ; # Technical report ;
    schema:name "A generalization of Tarjan's depth first search algorithm for the biconnectivity problem"@en ;
    schema:productID "15951819" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/15951819#PublicationEvent/edmonton_dept_of_computing_science_university_of_alberta_1982> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/10850370#Agent/dept_of_computing_science_university_of_alberta> ; # Dept. of Computing Science, University of Alberta
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/15951819> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/10850370#Agent/dept_of_computing_science_university_of_alberta> # Dept. of Computing Science, University of Alberta
    a bgn:Agent ;
    schema:name "Dept. of Computing Science, University of Alberta" ;
    .

<http://experiment.worldcat.org/entity/work/data/10850370#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/15951819> ; # A generalization of Tarjan's depth first search algorithm for the biconnectivity problem
    schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/10850370#Series/technical_report_university_of_alberta_department_of_computing_science> # Technical report (University of Alberta. Department of Computing Science) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/15951819> ; # A generalization of Tarjan's depth first search algorithm for the biconnectivity problem
    schema:name "Technical report (University of Alberta. Department of Computing Science) ;" ;
    .

<http://id.loc.gov/authorities/subjects/sh85056471> # Graph theory
    a schema:Intangible ;
    schema:name "Graph theory"@en ;
    .

<http://id.worldcat.org/fast/1156136> # Trees (Graph theory)
    a schema:Intangible ;
    schema:name "Trees (Graph theory)"@en ;
    .

<http://id.worldcat.org/fast/946584> # Graph theory
    a schema:Intangible ;
    schema:name "Graph theory"@en ;
    .

<http://viaf.org/viaf/104436570> # Yung Hyang Tsin
    a schema:Person ;
    schema:familyName "Tsin" ;
    schema:givenName "Yung Hyang" ;
    schema:name "Yung Hyang Tsin" ;
    .

<http://viaf.org/viaf/152390057> # University of Alberta. Department of Computing Science.
    a schema:Organization ;
    schema:name "University of Alberta. Department of Computing Science." ;
    .

<http://viaf.org/viaf/73933029> # Robert Endre Tarjan
    a schema:Person ;
    schema:birthDate "1948" ;
    schema:familyName "Tarjan" ;
    schema:givenName "Robert Endre" ;
    schema:givenName "Robert E." ;
    schema:name "Robert Endre Tarjan" ;
    .

<http://www.worldcat.org/title/-/oclc/15951819>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/15951819> ; # A generalization of Tarjan's depth first search algorithm for the biconnectivity problem
    schema:dateModified "2015-03-28" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.