ExLibris header image
SFX Logo
Title: The Parameterized Complexity of Geometric Graph Isomorphism
Source:

Algorithmica [0178-4617] yr:2016


Collapse list of basic services Basic
Full text
Full text available via SpringerLINK Contemporary 1997-Present
GO
Document delivery
Request document via Library/Bibliothek GO
Users interested in this article also expressed an interest in the following:
1. Matsliah, A. "Testing Graph Isomorphism." SIAM Journal on Computing 38.1 (2008): 207-225. Link to SFX for this item
Select All Clear All

Expand list of advanced services Advanced
A service provided by the Library of the Wissenschaftspark Albert Einstein, Potsdam, Germany.
© 2005 SFX by Ex Libris Inc.