Summary

• Page properties (1 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Content

...	...	@@ -12,6 +12,8 @@
12	12	The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for. (See ticket [[KIELER-1871>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-1871||shape="rect"]])
13	13	* **Layering Algorithms**
14	14	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
	15	+**Node Placement Algorithms**
	16	+Implement alternative algorithms for node placement to minimize the number of bend points produced.
15	15
16	16	== Modeling Pragmatics ==
17	17

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-7111225
	1	+7111226

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/7111225/Topics for Student Theses
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/7111226/Topics for Student Theses