A Family of Counter Examples to an Approach to Graph Isomorphism

Simple item page
dc.creatorCai, Jin-Yi
dc.creatorLu, Pinyan
dc.creatorXia, Mingji
dc.date2008-01-11
dc.date2008-01-12
dc.date.accessioned2026-07-07T08:53:49Z
dc.date.available2026-07-07T08:53:49Z
dc.descriptionWe give a family of counter examples showing that the two sequences of polytopes $Φ_{n,n}$ and $Ψ_{n,n}$ are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
dc.identifierhttps://arxiv.org/abs/0801.1766
dc.identifierhttp://arxiv.org/abs/0801.1766
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145756
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.titleA Family of Counter Examples to an Approach to Graph Isomorphism
dc.typetext

Files

Collections

arXiv