Sciweavers

3757 search results - page 192 / 752
» The overlap number of a graph
Sort
View
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ICPR
2006
IEEE
16 years 7 months ago
Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...
Jakob Kirkegaard, Thomas B. Moeslund
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 6 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
AB
2008
Springer
16 years 25 days ago
Local Structure and Behavior of Boolean Bioregulatory Networks
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
Heike Siebert
DM
2008
96views more  DM 2008»
15 years 6 months ago
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...