Back to Results
First PageMeta Content
Tree / Cograph / Line graph / Automorphism / Valuation / Graph theory / Graph operations / Knowledge representation


Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs Tommi Junttila∗
Add to Reading List

Open Document

File Size: 1,73 MB

Share Result on Facebook

Company

Aut / Intel / /

Country

Finland / /

/

Event

Reorganization / /

Facility

Latin square / University of Helsinki / Helsinki University of Technology / Helsinki Institute / /

IndustryTerm

celebrated software / present algorithm / physical hardware / search trees / isomorphic search trees / basic search tree / industrial applications / traversed search tree nodes / canonical labeling algorithm / linear-time solutions / software tools / backtrack algorithm / respective search trees / present tool / polynomial-time algorithm / subtree groups / chemical compounds / partition refiner / triple systems / substantial algorithm / automorphism / search tree / computing / canonical labeling algorithms / large automorphism / search tree node / polynomialtime algorithms / identity / /

OperatingSystem

Linux / GNU / /

Organization

Department of Computer Science / Laboratory for Theoretical Computer Science / Organization of the Paper / Helsinki Institute for Information Technology HIIT / University of Helsinki / Helsinki University of Technology / /

PublishedMedium

Theoretical Computer Science / /

Technology

fpga / present algorithm / substantial algorithm / Linux / Information Technology / canonical labeling algorithms / polynomial-time algorithm / canonical labeling algorithm / operating system / polynomialtime algorithms / /

SocialTag