Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
127
click to vote
MFCS
2007
Springer
121
views
Theoretical Computer Science
»
more
MFCS 2007
»
Hardness Results for Tournament Isomorphism and Automorphism
15 years 9 months ago
Download
www.uni-ulm.de
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
claim paper
Read More »
« first
‹ previous
1
2