skip to content
Finding a maximum-genus graph imbedding Preview this item
ClosePreview this item
Checking...

Finding a maximum-genus graph imbedding

Author: Merrick L Furst; Jonathan L Gross; Lyle A McGeoch
Publisher: Pittsburgh, PA. : Carnegie-Mellon University, Dept. of Computer Science, 1986.
Series: Carnegie-Mellon University.; Computer Science Department.; Research Papers.
Edition/Format:   Print book : EnglishView all editions and formats
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

Document Type: Book
All Authors / Contributors: Merrick L Furst; Jonathan L Gross; Lyle A McGeoch
OCLC Number: 13816834
Description: 17 pages : illustrations ; 28 cm.
Series Title: Carnegie-Mellon University.; Computer Science Department.; Research Papers.
Responsibility: Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch.

Reviews

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

Tags

Be the first.

Similar Items

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/13816834> # Finding a maximum-genus graph imbedding
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "13816834" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1909000598#Place/pittsburgh_pa> ; # Pittsburgh, PA.
    schema:about <http://dewey.info/class/510.7808/> ;
    schema:about <http://id.worldcat.org/fast/946584> ; # Graph theory
    schema:about <http://id.worldcat.org/fast/868961> ; # Combinatorial analysis
    schema:about <http://id.worldcat.org/fast/1152692> ; # Topology
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/1909000598#Person/gross_jonathan_l> ; # Jonathan L. Gross
    schema:contributor <http://viaf.org/viaf/112436873> ; # Lyle A. McGeoch
    schema:creator <http://viaf.org/viaf/16025114> ; # Merrick L. Furst
    schema:datePublished "1986" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1909000598> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/1909000598#Series/research_papers> ; # Research Papers. ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/1909000598#Series/research_papers_carnegie_mellon_university_department_of_computer_science> ; # Research Papers. Carnegie-Mellon University. Department of Computer Science. ;
    schema:name "Finding a maximum-genus graph imbedding"@en ;
    schema:productID "13816834" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/13816834#PublicationEvent/pittsburgh_pa_carnegie_mellon_university_dept_of_computer_science_1986> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1909000598#Agent/carnegie_mellon_university_dept_of_computer_science> ; # Carnegie-Mellon University, Dept. of Computer Science
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/13816834> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1909000598#Agent/carnegie_mellon_university_dept_of_computer_science> # Carnegie-Mellon University, Dept. of Computer Science
    a bgn:Agent ;
    schema:name "Carnegie-Mellon University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/1909000598#Organization/carnegie_mellon_university_computer_science_department> # Carnegie-Mellon University. Computer Science Department.
    a schema:Organization ;
    schema:name "Carnegie-Mellon University. Computer Science Department." ;
    .

<http://experiment.worldcat.org/entity/work/data/1909000598#Person/gross_jonathan_l> # Jonathan L. Gross
    a schema:Person ;
    schema:familyName "Gross" ;
    schema:givenName "Jonathan L." ;
    schema:name "Jonathan L. Gross" ;
    .

<http://experiment.worldcat.org/entity/work/data/1909000598#Place/pittsburgh_pa> # Pittsburgh, PA.
    a schema:Place ;
    schema:name "Pittsburgh, PA." ;
    .

<http://experiment.worldcat.org/entity/work/data/1909000598#Series/research_papers> # Research Papers. ;
    a bgn:PublicationSeries ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/1909000598#Organization/carnegie_mellon_university_computer_science_department> ; # Carnegie-Mellon University. Computer Science Department.
    schema:hasPart <http://www.worldcat.org/oclc/13816834> ; # Finding a maximum-genus graph imbedding
    schema:name "Research Papers. ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/1909000598#Series/research_papers_carnegie_mellon_university_department_of_computer_science> # Research Papers. Carnegie-Mellon University. Department of Computer Science. ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/13816834> ; # Finding a maximum-genus graph imbedding
    schema:name "Research Papers. Carnegie-Mellon University. Department of Computer Science. ;" ;
    .

<http://id.worldcat.org/fast/1152692> # Topology
    a schema:Intangible ;
    schema:name "Topology"@en ;
    .

<http://id.worldcat.org/fast/868961> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

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

<http://viaf.org/viaf/112436873> # Lyle A. McGeoch
    a schema:Person ;
    schema:birthDate "1959" ;
    schema:familyName "McGeoch" ;
    schema:givenName "Lyle A." ;
    schema:name "Lyle A. McGeoch" ;
    .

<http://viaf.org/viaf/16025114> # Merrick L. Furst
    a schema:Person ;
    schema:familyName "Furst" ;
    schema:givenName "Merrick L." ;
    schema:name "Merrick L. Furst" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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