Sciweavers

5889 search results - page 36 / 1178
» Graph Layout Problems
Sort
View
VISSOFT
2005
IEEE
14 years 3 months ago
Evaluating UML Class Diagram Layout based on Architectural Importance
The paper presents and assesses a layout scheme for UML class diagrams that takes into account the architectural importance of a class in terms of its stereotype (e.g., boundary, ...
Olena Andriyevska, Natalia Dragan, Bonita Simoes, ...
AAAI
2008
14 years 6 days ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
WG
2007
Springer
14 years 4 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
Bruno Escoffier, Laurent Gourvès, Jé...
IV
2005
IEEE
161views Visualization» more  IV 2005»
14 years 3 months ago
Adaptive Site Map Visualization Based on Landmarks
Site maps are frequently provided on Web sites as a navigation support for Web users. The automatic generation of site maps is a complex task since the structure of the data, sema...
Dirk Kukulenz
IJON
2010
94views more  IJON 2010»
13 years 8 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix