Results 1  10
of
408,147
Multilevel graph layout on the GPU
 IEEE TRANS. VIS. COMPUT. GRAPH
, 2007
"... This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multilevel scheme, which is based on spectral partitioning. The second contri ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multilevel scheme, which is based on spectral partitioning. The second
Highperformance multilevel graphs
 IN: 9TH DIMACS IMPLEMENTATION CHALLENGE
, 2006
"... Shortestpath computation is a frequent task in practice. Owing to evergrowing realworld graphs, there is a constant need for faster algorithms. In the course of time, a large number of techniques to heuristically speed up Dijkstra’s shortestpath algorithm have been devised. This work reviews the ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
the multilevel technique to answer shortestpath queries exactly [SWZ02, HSW06], which makes use of a hierarchical decomposition of the input graph and precomputation of supplementary information. We develop this preprocessing to the maximum and introduce several ideas to enhance this approach considerably
The VertexExchange Graph and its use in MultiLevel Graph Layout
 In Kratochvil [Kra99
, 1999
"... In this paper we consider the problems of testing a multilevel graph for planarity and laying out or, drawing, a multilevel graph in a clear way. Our approach is based on integer linear programming. We introduce a new abstraction of a common integer linear programming formulation of the problems t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper we consider the problems of testing a multilevel graph for planarity and laying out or, drawing, a multilevel graph in a clear way. Our approach is based on integer linear programming. We introduce a new abstraction of a common integer linear programming formulation of the problems
Using Multilevel Graphs for Timetable Information in Railway Systems
 IN PROCEEDINGS 4TH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS (ALENEX 2002), VOLUME 2409 OF SPRINGER LNCS
, 2002
"... In many fields of application shortest path finding problems in very large graphs arise. Scenarios where large numbers ofonW##O queries for shortest paths have to be processedin realtime appear for examplein tra#cinc5###HF5 systems.In such systems, the techn5Ww# con sidered to speed up the shortes ..."
Abstract

Cited by 32 (14 self)
 Add to MetaCart
experimen tal study of such a spacereduction approach. Wein troduce theconOkW of multilevel graph decomposition Foron specificapplication scenica from the field of timetable information in public tranc ort, we perform a detailed anai ysisan experimen tal evaluation of shortest path computation based
Scalable name disambiguation using multilevel graph partition
 In Proceedings of the SIAM Int’l Conf. on Data Mining (SDM’07
, 2007
"... When nonunique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names ” of entities are used as their identifier, the problem is often referred to as the name disambiguation problem, where goal is to sort out the erroneous enti ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
large number of entities get undistinguishable due to homonyms, how to resolve it? We first carefully examine two of the stateoftheart solutions to the name disambiguation problem, and point out their limitations with respect to scalability. Then, we adapt the multilevel graph partition technique
Scalable Name Disambiguation using Multilevel Graph Partition
, 2007
"... When nonunique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names ” of entities are used as their identifier, the problem is often referred to as the name disambiguation problem, where goal is to sort out the erroneous enti ..."
Abstract
 Add to MetaCart
large number of entities get undistinguishable due to homonyms, how to resolve it? We first carefully examine two of the stateoftheart solutions to the name disambiguation problem, and point out their limitations with respect to scalability. Then, we adapt the multilevel graph partition technique
TopoLayout: Multilevel graph layout by topological features
 IEEE TRANS. VISUALIZATION AND COMPUTER GRAPHICS
, 2007
"... We describe TopoLayout, a featurebased,
multilevel algorithm that draws undirected graphs based on the topological features they contain. Topological features are detected recursively inside the graph, and their subgraphs are collapsed into single nodes, forming a graph hierarchy. Each feature is ..."
Abstract

Cited by 58 (6 self)
 Add to MetaCart
We describe TopoLayout, a featurebased,
multilevel algorithm that draws undirected graphs based on the topological features they contain. Topological features are detected recursively inside the graph, and their subgraphs are collapsed into single nodes, forming a graph hierarchy. Each feature
Optimized Graph Search Using MultiLevel Graph Clustering
, 2009
"... Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized in t ..."
Abstract
 Add to MetaCart
Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized
Scalable Name Disambiguation using Multilevel Graph Partition Abstract ByungWon On
"... When nonunique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names ” of entities are used as their identifier, the problem is often referred to as the name disambiguation problem, where goal is to sort out the erroneous enti ..."
Abstract
 Add to MetaCart
large number of entities get undistinguishable due to homonyms, how to resolve it? We first carefully examine two of the stateoftheart solutions to the name disambiguation problem, and point out their limitations with respect to scalability. Then, we adapt the multilevel graph partition technique
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
408,147