SearcharxivSearch

arXiv subjects

Cesim Erten

Publications and source records attributed to Cesim Erten.

2 recordsLinked to original sources

Size Should Not Matter: Evaluating Network Visualizations with Stress

The normalized stress metric is widely used to assess graph drawing quality, measuring how closely distances between vertices in a layout match their graph-theoretic distances. This metric is a standard for both evaluation and optimization in many popular graph layout algorithms. However, normalized stress is highly sensitive to the scale (size) of the drawing, leading to potentially misleading comparisons between layouts produced by different algorithms. Uniformly scaling a layout can significantly alter stress values without changing the underlying structure, even to the extent that a clearly superior layout can appear to have a higher stress score than a random layout. Although this issue is recognized within the network visualization community, it is rarely addressed with sufficient detail in publications, resulting in critical calculation errors in recent studies. In this paper, we systematically examine various stress metrics used in the literature and demonstrate that commonly used metrics are affected by layout scale, undermining their reliability for comparison. We identify scale-invariant alternatives and propose scale-normalized stress for fair stress-based evaluation.

cs.CG

Structure of conflict graphs in constraint alignment problems and algorithms

We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex pairs are adjacent in their respective graphs. %In general terms The goal is to provide a one-to-one mapping between the vertices of the input graphs in order to maximize edge conservation. However the allowed mappings are restricted since each vertex from $V_1$ (resp. $V_2$) is allowed to be mapped to at most $m_1$ (resp. $m_2$) specified vertices in $V_2$ (resp. $V_1$). Most of results in this paper deal with the case $m_2=1$ which attracted most attention in the related literature. We formulate the problem as a maximum independent set problem in a related {\em conflict graph} and investigate structural properties of this graph in terms of forbidden subgraphs. We are interested, in particular, in excluding certain wheals, fans, cliques or claws (all terms are defined in the paper), which corresponds in excluding certain cycles, paths, cliques or independent sets in the neighborhood of each vertex. Then, we investigate algorithmic consequences of some of these properties, which illustrates the potential of this approach and raises new horizons for further works. In particular this approach allows us to reinterpret a known polynomial case in terms of conflict graph and to improve known approximation and fixed-parameter tractability results through efficiently solving the maximum independent set problem in conflict graphs. Some of our new approximation results involve approximation ratios that are function of the optimal value, in particular its square root; this kind of results cannot be achieved for maximum independent set in general graphs.

cs.DS