Sciweavers

394 search results - page 29 / 79
» Testing subgraphs in large graphs
Sort
View
JGAA
2007
93views more  JGAA 2007»
13 years 9 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 6 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 10 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
CPAIOR
2008
Springer
13 years 10 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...