1736 search results - page 30 / 348 » On antimagic directed graphs |
150
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
185
click to vote
ER
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
184
Voted
ICDM
2009
IEEE
15 years 3 months ago
2009
IEEE
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...
159
click to vote
ADHOCNOW
2008
Springer
16 years 9 days ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
151
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...