bio | website | turkistany.blogspot.com |
---|---|---|
location | Makkah, Saudi Arabia | |
age | 44 | |
visits | member for | 4 years, 2 months |
seen | yesterday | |
stats | profile views | 766 |
Wild Florida Gator living in Arabia
Mohammad Al-Turkistany, Ph.D. in Computer Engineering, University of Florida
Assistant Professor of Computer Engineering, Umm Al-Qura University, Makkah, Saudi Arabia
"The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable".
George Bernard Shaw
"You can't turn mince back into meat by rotating the mincer's handle in the opposite direction"
Jul 16 |
comment |
How hard is a variant of graph automorphism problem?
@Kimball No, GA is not known to be GI-hard. I'm not looking for heuristics. |
Jul 16 |
revised |
How hard is a variant of graph automorphism problem?
added 21 characters in body |
Jul 16 |
revised |
How hard is a variant of graph automorphism problem?
added 412 characters in body |
Jul 14 |
comment |
How hard is a variant of graph automorphism problem?
@EmilJeÅ™ábek I seek non-trivial automorphism. Fixed the statement of the question. |
Jul 14 |
revised |
How hard is a variant of graph automorphism problem?
added 11 characters in body |
Jul 14 |
comment |
How hard is a variant of graph automorphism problem?
$GA$ problem: Input : a graph $G(V, E)$, Question: Is there non-trivial automorphism of $G$ ( other that the identity )? |
Jul 14 |
asked | How hard is a variant of graph automorphism problem? |
Jul 9 |
accepted | Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs |
Jul 7 |
comment |
Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs
Emil, thanks for your answer. Although FP sampling function is an intuitive interpretation, I am interested in efficient sampling in the sense of Nisan's answer. |
Jul 5 |
revised |
Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs
added 1 character in body |
Jul 5 |
asked | Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs |
Jul 2 |
awarded | Curious |
Feb 6 |
revised |
Cubic graphs decompositions
corrected grammar |
Feb 3 |
comment |
Cubic graphs decompositions
@JosephO'Rourke Good idea. Are you aware of polynomial-time decomposition problem (of connected cubic graph) of type I mentioned in my motivation? |
Feb 3 |
revised |
Cubic graphs decompositions
added 365 characters in body |
Feb 3 |
revised |
Cubic graphs decompositions
added 106 characters in body |
Feb 2 |
revised |
Cubic graphs decompositions
added 2 characters in body; edited tags |
Feb 2 |
revised |
Cubic graphs decompositions
edited body |
Feb 2 |
revised |
Cubic graphs decompositions
edited body |
Feb 2 |
asked | Cubic graphs decompositions |