Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
Ludek Kucera
Venue
A
STACS
Year
1985
Proceedings
STACS
DBLP record
conf/stacs/Kucera85 ↗
Browse the full
STACS paper archive
.