Oct 9, 2009 · Abstract: Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete. We show that whether a building-free ...
May 1, 2011 · Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete (Hoàng in SIAM J Discret Math 23:2156–2162, 2010).
Oct 9, 2009 · The class of building- free graphs generalizes several classes of graphs for which an efficient test for the presence of a sun is known. We also ...
May 1, 2012 · Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete (Hoàng in SIAM J Discret Math 23:2156–2162, 2010).
It is shown that whether a building-free graph contains a sun can be decided in O(min{mn3, m1.5n2}) time and, if a sun exists, it can be found in the same ...
A little online application with interactive map that shows sun movement and sunlight phases during the given day at the given location.
We show that whether a building-free graph contains a sun can be decided in O(min$\{m{n^3}, m^{1.5}n^2\}$) time and, if a sun exists, it can be found in the ...
Sun path charts can be plotted either in Cartesian (rectangular) or Polar coordinates. Cartesian coordinates where the solar elevation is plotted on Y axis and ...
The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent.
Shadowmap helps you to visualize and analyze sunlight, shadows and solar potential. Our 3D digital twin provides solar intelligence at your fingertips.
Missing: Graphs. | Show results with:Graphs.