On the Complexity of Checking Self-duality of Polytopes and its Relations to 
Vertex Enumeration and Graph Isomorphism

Tiwary, Hans Raj; Elbassioni, Khaled

doi:10.1145/1377676.1377707

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism

MPS-Authors

/persons/resource/persons45623

Tiwary, Hans Raj
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44374

Elbassioni, Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Tiwary, H. R., & Elbassioni, K. (2008). On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. In M. Teillaud, & E. Welzl (Eds.), Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG'08) (pp. 192-198). New York, NY: ACM. doi:10.1145/1377676.1377707.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1C7C-A

Abstract

There is no abstract available