Sciweavers

554 search results - page 40 / 111
» Power Domination Problem in Graphs
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
BMCBI
2006
140views more  BMCBI 2006»
13 years 7 months ago
Feature selection using Haar wavelet power spectrum
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...
Prabakaran Subramani, Rajendra Sahu, Shekhar Verma
ICALP
2003
Springer
14 years 26 days ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
CEC
2005
IEEE
13 years 9 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 4 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu