On Writing Isomorphism Programs

William Kocay ()
Additional contact information
William Kocay: University of Manitoba, Department of Computer Science

Chapter Chapter 6 in Computational and Constructive Design Theory, 1996, pp 135-175 from Springer

Abstract: Abstract This is a self-contained exposition on how to write isomorphism programs. It is intended for people who want to write isomorphism programs for combinatorial structures, such as graphs, designs, digraphs, posets, etc.

Keywords: Cell Orbit; Leaf Node; Adjacency Matrix; Search Tree; Graph Isomorphism (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-2497-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9781475724974

DOI: 10.1007/978-1-4757-2497-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().