In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
Stability in cluster analysis is strongly dependent on the data set, especially on how well separated and how homogeneous the clusters are. In the same clustering, some clusters m...