Back to Results
First PageMeta Content
Line graph / Equivalence relation / Graph pebbling / Pseudoforest / Graph theory / Algebraic graph theory / Graph automorphism


Faster Symmetry Discovery using Sparsity of Symmetries Paul T. Darga, Karem A. Sakallah, and Igor L. Markov Electrical Engineering and Computer Science Department
Add to Reading List

Document Date: 2008-06-19 00:37:44


Open Document

File Size: 243,68 KB

Share Result on Facebook

Company

CNF / Puget / /

Continent

Europe / /

Currency

USD / /

/

Event

Force Majeure / /

Facility

Computer Science Department The University of Michigan / /

IndustryTerm

formal algorithm / internet adaptec1 adaptec2 adaptec3 adaptec4 bigblue1 bigblue2 bigblue3 / search ends / road network / search trees / technology mapping / symmetry-discovery algorithm / symmetry discovery algorithms / canonical labeling algorithm / search decision engine / search tree / internet map discovery / canonical labeling tool / given / search space / computational tools / exhaustive search / graph symmetry tool / /

OperatingSystem

Fedora 7 / /

Organization

U.S. Census Bureau / The University of Michigan / /

Person

Igor L. Markov / Paul T. Darga / /

Position

representative / single representative / Graph algorithms General / /

Technology

Graph algorithms / formal algorithm / 2 Duo processor / previously published algorithms / symmetry discovery algorithms / canonical labeling algorithm / html / symmetry-discovery algorithm / Computer Algorithms / /

URL

http /

SocialTag