Ara
Toplam kayıt 3, listelenen: 1-3
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...
Colored simultaneous geometric embeddings
(Springer-Verlag Berlin, 2007)
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored ...
GSPIM: Graphical visualization tool for MIPS assembly programming and simulation
(2007)
We describe our system, GSPIM, used for visualization of low-level MIPS Assembly programming and simulation. Although many visualization tools for algorithms and high-level programs have been considered in educational ...