The following is an archived discussion of Circular layout's DYK nomination. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page; such as this archived nomination"s (talk) page, the nominated article's (talk) page, or the Did you know
(talk) page. Unless there is consensus to re-open the archived discussion here. No further edits should be made to this page. See the talk page guidelines for (more) information.
The result was: promoted by PanydThe muffin is not subtle 14:26, 27 March 2013 (UTC).
DYK toolbox |
---|
Circular layout
edit... that a randomized circular layout of a graph, used for the initial state of the Planarity puzzle, approximates the largest number of edge crossings possible for any layout?
- Reviewed: Philemon Holland
Created by David Eppstein (talk). Self nominated at 20:00, 24 March 2013 (UTC).
Article created and nominated 24 March, and is about 4200 characters, satisfying length and date criteria. Article is sourced, but I could only directly verify a few claims, as most sources are paywalled, so I will assume good faith for these. Hook is a reasonable length, but the article does not have a citation for that particular statement. I would suggest an alternate hook, as the average reader is not likely to find this interesting (as with most math-related concepts). I've provided ALT1 and ALT2, which I've already verified in my review. QPQ completed. Good to go. Mindmatrix 16:24, 25 March 2013 (UTC)
- ALT1: ... that circular layouts are a good fit for communications network topologies such as star or ring networks?
- ALT2: ... that circular layouts may be used for social network graphs, network topologies, or gene interaction graphs?
- ALT2 is a generic statement that could be used of any graph drawing style; it says nothing specific about circular layouts. And ALT1 doesn't even give the reader a clue about what kind of thing these layouts are. I wanted to include Planarity in the hook, because I think that is something non-mathematical readers can appreciate.. How about making my original hook less technical by taking the approximation part out, as
ALT3 ...that the Planarity puzzle, in which players must untangle a planar graph, uses a circular layout as its starting point?
- I've struck this temporarily while I look for better sources, though, since your complaint about the hook sourcing is valid: Verbitsky doesn't actually say the layout is circular. —David Eppstein (talk) 17:00, 25 March 2013 (UTC)
- I'm not attached to my alternate hook suggestions, and I agree they're generic. I'll review any alternate hook you provide. (I did a quick search on Google Scholar, but all references to "planarity" were about the concept "planar graph".) Mindmatrix 17:12, 25 March 2013 (UTC)
- Sadly, the best source I can find for ALT3 is this blog post from two years ago. It probably does pass the "recognized expert" clause of WP:SPS, but since I wrote it myself, it's a bit embarrassing to use as the hook source. So how about
- ALT4 ... that circular layouts, in which the nodes of a graph are drawn on a circle, have been used to visualize the cyclic parts of metabolic networks?
- (Also having the advantage that its source is open access.) —David Eppstein (talk) 18:30, 25 March 2013 (UTC)