際際滷shows by User: nikolovn / http://www.slideshare.net/images/logo.gif 際際滷shows by User: nikolovn / Mon, 02 Mar 2015 18:45:25 GMT 際際滷Share feed for 際際滷shows by User: nikolovn How to Layer a Directed Acyclic Graph (GD 2001) /slideshow/gd-2001-ver2/45345695 gd2001ver-150302184525-conversion-gate01
We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs.]]>
We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs.]]> Mon, 02 Mar 2015 18:45:25 GMT /slideshow/gd-2001-ver2/45345695 nikolovn@slideshare.net(nikolovn) How to Layer a Directed Acyclic Graph (GD 2001) nikolovn We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/gd2001ver-150302184525-conversion-gate01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs.
How to Layer a Directed Acyclic Graph (GD 2001) from Nikola S. Nikolov
]]> 1097 3 https://cdn.slidesharecdn.com/ss_thumbnails/gd2001ver-150302184525-conversion-gate01-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://cdn.slidesharecdn.com/profile-photo-nikolovn-48x48.jpg?cb=1523538243 Modules I have taught since 2007: - Database Systems (current, since 2007/2008) - Data Mining and Data Warehousing (current, since 2011/2012) - Virtual Worlds (current, since 2012/2013) - Computer Applications for Scientists I - Web Development - Web Development for Media Students - Document Architectures - Operating Systems - Computer Applications www.csis.ul.ie/userprofile/&user=131