Sciweavers

372 search results - page 22 / 75
» Mining the space of graph properties
Sort
View
PODC
2006
ACM
14 years 3 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SDM
2008
SIAM
120views Data Mining» more  SDM 2008»
13 years 11 months ago
Spatial Scan Statistics for Graph Clustering
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
Bei Wang, Jeff M. Phillips, Robert Schreiber, Denn...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 4 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
14 years 3 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
ISHPC
2003
Springer
14 years 2 months ago
Chordal Topologies for Interconnection Networks
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Ramón Beivide, Carmen Martínez, Cruz...