"Colored Hypergraph Isomorphism is Fixed Parameter Tractable."

Vikraman Arvind et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-013-9787-Y

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ArvindDKT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ArvindDKT15
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71(1): 120-138 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.