Sciweavers

1736 search results - page 62 / 348
» On antimagic directed graphs
Sort
View
EUROPAR
2004
Springer
14 years 3 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
14 years 5 months ago
RTG: A Recursive Realistic Graph Generator Using Random Typing
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
Leman Akoglu, Christos Faloutsos
SOCIALCOM
2010
13 years 8 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates
ICASSP
2011
IEEE
13 years 2 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 5 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...