Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with graph-drawing
Search options not deleted
user 5340
Problems related to graph drawing such as crossing numbers, layout designs, and intersection graphs.
4
votes
Visualizing polyhedra from their 1-skeletons
For your question (1), there is an efficient algorithm [1] known for finding an embedding of a graph in the plane if an embedding exists.
This, however, might not be the end of the story. You may wan …
- 1,944
8
votes
Is every graph an edge-crossing graph?
No, and you can see this from just a counting argument.
For determining which of the $ n $ chords of the circle intersect, it is enough to know the order of the $ 2n $ endpoints on the circle. (You …
- 1,944