Sciweavers

2125 search results - page 37 / 425
» On Graph Complexity
Sort
View
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 7 months ago
The Shannon capacity of a graph and the independence numbers of its powers
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
Noga Alon, Eyal Lubetzky
ESANN
2008
13 years 9 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 27 days ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 5 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
IWPC
2010
IEEE
13 years 6 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy