I'm looking for the most suitable place to ask a question about an algorithm for layouting a mixed constituency/dependency tree. Theoretical Computer Science seemed a good starting point, as it has a great number of algorithm questions, but I'm not sure whether Computational Science beta (http://scicomp.stackexchange.com/) might be the better option, seeing that I'm looking for a graph drawing algorithm (to be used for visualisation) rather than a graph algorithm.

What are your opinions?

Many thanks!

  • 2
    $\begingroup$ I think typically asking for software/implementation is off-topic here, the scope is research-level questions in TCS as explained in the FAQ and questions asking for software/implementation do not fall in this scope. (However there can be exceptional question asking for software when the question it is related to research in TCS and fall inside the scope of cstheory.) $\endgroup$
    – Kaveh
    Jun 20 '12 at 16:51
  • 1
    $\begingroup$ Thanks, Kaveh. I'll refrain from asking the question, and instead review the FAQs again :). $\endgroup$
    – s.d
    Jun 21 '12 at 7:17
  • $\begingroup$ Hi again, I re-read your comment just now. In fact I wouldn't ask for software/implementation, but for a graph drawing algorithm. I'll edit my question to reflect this better. $\endgroup$
    – s.d
    Jun 28 '12 at 10:09

If you're asking about graph drawing, that's certainly within scope. Graph drawing is a rich subcommunity at the intersection of graph theory and computational geometry.

  • $\begingroup$ Thanks. Yes, this would be about graph drawing, and more specifically an algorithm. $\endgroup$
    – s.d
    Jun 22 '12 at 11:48
  • $\begingroup$ Yup. Definitely post it. $\endgroup$ Jun 22 '12 at 15:24
  • $\begingroup$ Thanks, will do! $\endgroup$
    – s.d
    Jun 23 '12 at 8:32
  • $\begingroup$ Done. I really do hope the question is suitable. $\endgroup$
    – s.d
    Jun 28 '12 at 10:07

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .