Sciweavers

446 search results - page 22 / 90
» Extremal Stable Graphs
Sort
View
IJCAI
2007
13 years 10 months ago
A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
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...
Bart Verheij
INFOCOM
2012
IEEE
11 years 11 months ago
Impact of power-law topology on IP-level routing dynamics: Simulation results
—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...
Amelie Medem Kuatse, Clémence Magnien, Fabi...
WG
2007
Springer
14 years 2 months ago
Obtaining a Planar Graph by Vertex Deletion
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...
Dániel Marx, Ildikó Schlotter
GBRPR
2009
Springer
14 years 1 months ago
A Recursive Embedding Approach to Median Graph Computation
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...
CSDA
2007
103views more  CSDA 2007»
13 years 8 months ago
Cluster-wise assessment of cluster stability
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...
Christian Hennig