Find results with:

Search by date

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

A polynomial time algorithm for isomorphism of directed graphs of bounded valence.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Call No.	QA166.15 .G53
Author	Glaser, Mary E.
Title	A polynomial time algorithm for isomorphism of directed graphs of bounded valence.
Date	1982
Description	1 online resource (vii, 91 leaves) : illustrations
Format	application/pdf
Subject	Directed graphs. ; Algorithms. ; Isomorphisms (Mathematics).
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D)--Dartmouth College.
Copyright	In Copyright. This material is protected by copyright and/or related rights. You are free to use this material in any way that is permitted by copyright law that applies to your use. For other uses, you need to obtain permission from the rights-holder(s). http://rightsstatements.org/page/InC/1.0/
DOI	https://doi.org/10.1349/ddlp.3110

Title	glaser1982 1
Full Text	A POLYNOMIAL TIME ALGORITHM FOR ISOMORPHISM OF DIRECTED GRAPHS OF BOUNDED VALENCE A Thesis Submitted to le Faculty in partial fulfillment of the requirements for the Mary E. Glaser t DARTMOUTH COLLEGE Hanover, New Hampshire June 1982 degree of Doctor of Philosophy by

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12