829 search results - page 62 / 166 » Distance domination-critical graphs |
ICML
2005
IEEE
16 years 21 days ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
172
click to vote
CP
2009
Springer
16 years 16 days ago
2009
Springer
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
TIT
1998
14 years 11 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
102
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...