<--- Back to Details
First PageDocument Content
Morphisms / Computational complexity theory / Parameterized complexity / Graph isomorphism problem / Graph isomorphism / Minor / Graph canonization / Feedback vertex set / Tree decomposition / Graph theory / Theoretical computer science / Mathematics
Morphisms
Computational complexity theory
Parameterized complexity
Graph isomorphism problem
Graph isomorphism
Minor
Graph canonization
Feedback vertex set
Tree decomposition
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: www.informatik.hu-berlin.de

Download Document from Source Website

File Size: 20,73 KB

Share Document on Facebook

Similar Documents

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

DocID: 1ppLN - View Document

PDF Document

DocID: 16E9w - View Document

A Logspace Algorithm for Tree Canonization (Extended Abstract) Steven Lindell †

A Logspace Algorithm for Tree Canonization (Extended Abstract) Steven Lindell †

DocID: 62Sp - View Document

PDF Document

DocID: oZ6 - View Document