Login / Signup
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.
Hans Raj Tiwary
Khaled M. Elbassioni
Published in:
SCG (2008)
Keyphrases
</>
graph isomorphism
conp complete
np complete
decision problems
data exchange
computational complexity
conjunctive queries
search space
dynamic programming
linear programming
data complexity
np hard
pattern matching
expressive power
graph data
graph search