5889 search results - page 108 / 1178 » Graph Layout Problems |
101
click to vote
DAM
2006
15 years 2 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
158
Voted
VISSOFT
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper a new approach for a metrics based software visualization is presented which supports an efficient and effective quality assessment of large object-oriented software...
APVIS
2009
15 years 3 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
138
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
132
click to vote
DAM
2000
15 years 2 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...