A linear time algorithm for isomorphism of graphs of bounded average genus /
Abstract: "A structure theorem is proved for the class of graphs of bounded average genus, which leads to a linear time algorithm for isomorphism of such graphs."
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1991]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
91-015. |
| Subjects: |
| Summary: | Abstract: "A structure theorem is proved for the class of graphs of bounded average genus, which leads to a linear time algorithm for isomorphism of such graphs." |
|---|---|
| Item Description: | "March 1991." |
| Physical Description: | 25 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |