Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computing roots of directed graphs is graph isomorphism hard - MaRDI portal

Computing roots of directed graphs is graph isomorphism hard

From MaRDI portal

Publication:6471969

Jump to:navigation, search

arXivmath/0207020MaRDI QIDQ6471969

Martin Kuetz

Publication date: 2 July 2002

Mathematics Subject Classification ID

Factorization of matrices (15A23) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Boolean algebras (Boolean rings) (06E99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Computing roots of directed graphs is graph isomorphism hard

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6471969&oldid=36172738"