Sciweavers

156 search results - page 4 / 32
» The Complexity of the Evolution of Graph Labelings
Sort
View
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
14 years 8 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
FMCAD
2007
Springer
14 years 1 months ago
Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs
Abstract— The relationship between changes in gene expression and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with...
Neha Rungta, Hyrum Carroll, Eric G. Mercer, Randal...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
AE
2003
Springer
14 years 21 days ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...