112 search results - page 10 / 23 » Schematisation of Tree Drawings |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
EDUTAINMENT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper presents a strategy of dynamic user modeling for sketchbased user interface. A user model is defined as an incremental decision tree for a specific user. A dra...
SIAMCOMP
2000
13 years 7 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
GD
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
IV
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...