Results 1  10
of
95
Streaming Meshes
, 2005
"... Recent years have seen an immense increase in the complexity of geometric data sets. Today's gigabytesized polygon models can no longer be completely loaded into the main memory of common desktop PCs. Unfortunately, current mesh formats do not account for this. They were designed years ago when mes ..."
Abstract

Cited by 67 (17 self)
 Add to MetaCart
Recent years have seen an immense increase in the complexity of geometric data sets. Today's gigabytesized polygon models can no longer be completely loaded into the main memory of common desktop PCs. Unfortunately, current mesh formats do not account for this. They were designed years ago when meshes were orders of magnitudes smaller. Using such formats to store large meshes is inefficient and unduly complicates all subsequent processing.
MatrixExplorer: a DualRepresentation System to Explore Social Networks
 IEEE Transactions on Visualization and Computer Graphics
, 2006
"... Abstract — MatrixExplorer is a network visualization system that uses two representations: nodelink diagrams and matrices. Its design comes from a list of requirements formalized after several interviews and a participatory design session conducted with social science researchers. Although matrices ..."
Abstract

Cited by 55 (12 self)
 Add to MetaCart
Abstract — MatrixExplorer is a network visualization system that uses two representations: nodelink diagrams and matrices. Its design comes from a list of requirements formalized after several interviews and a participatory design session conducted with social science researchers. Although matrices are commonly used in social networks analysis, very few systems support the matrixbased representations to visualize and analyze networks. MatrixExplorer provides several novel features to support the exploration of social networks with a matrixbased representation, in addition to the standard interactive filtering and clustering functions. It provides tools to reorder (layout) matrices, to annotate and compare findings across different layouts and find consensus among several clusterings. MatrixExplorer also supports Nodelink diagram views which are familiar to most users and remain a convenient way to publish or communicate exploration results. Matrix and nodelink representations are kept synchronized at all stages of the exploration process. Index Terms — social networks visualization, nodelink diagrams, matrixbased representations, exploratory process, matrix ordering, interactive clustering, consensus. Fig. 1. MatrixExplorer showing two synchronized representations of the same network: matrix on the left and nodelink on the right. 1
Cacheoblivious mesh layouts
 ACM Trans. Graph
, 2005
"... ACM acknowledges that this contribution was authored or coauthored by a contractor of affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royaltyfree right to publish or reproduce this article, or to allow others to do so, for Government purposes only. ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
ACM acknowledges that this contribution was authored or coauthored by a contractor of affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royaltyfree right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Parameterized complexity and approximation algorithms
 Comput. J
, 2006
"... Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. In this paper, our aim is to investigate how these two fields can be combined to achieve better algorithms than what any of the two theories could offer. We ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. In this paper, our aim is to investigate how these two fields can be combined to achieve better algorithms than what any of the two theories could offer. We discuss the different ways parameterized complexity can be extended to approximation algorithms, survey results of this type and propose directions for future research. 1.
A MultiScale Algorithm for the Linear Arrangement Problem
 Proc. 28th Inter. Workshop on GraphTheoretic Concepts in Computer Science (WG’02), LNCS 2573
, 2002
"... Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a lineartime algorithm for this problem, based on the multiscale paradigm. Experimental results are similar to those of the best known approaches, while the running ti ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a lineartime algorithm for this problem, based on the multiscale paradigm. Experimental results are similar to those of the best known approaches, while the running time is significantly better, enabling it to deal with much larger graphs. The paper contains a general multiscale construction, which may be used for a broader range of ordering problems.
Layout of Graphs with Bounded TreeWidth
 2002, submitted. Stacks, Queues and Tracks: Layouts of Graph Subdivisions 41
, 2004
"... A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straight line grid) drawing of a gr ..."
Abstract

Cited by 26 (20 self)
 Add to MetaCart
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straight line grid) drawing of a graph represents the vertices by points in Z and the edges by noncrossing linesegments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of threedimensional drawing of a graph G is closely related to the queuenumber of G. In particular, if G is an nvertex member of a proper minorclosed family of graphs (such as a planar graph), then G has a O(1) O(1) O(n) drawing if and only if G has O(1) queuenumber.
Centrality Measures Based on Current Flow
, 2005
"... We consider variations of two wellknown centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the currentflow variant of close ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
We consider variations of two wellknown centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the currentflow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing both measures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for currentflow betweenness.
Graph Minimum Linear Arrangement by Multilevel Weighted Edge Contractions
, 2006
"... The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. Our results turned out to be better than every known result in almost all cases, while the short running time of the algorithm enabled experiments with very large graphs.
On Bipartite Drawings and the Linear Arrangement Problem
"... The bipartite crossing number problem is studied, and a connection between this problemand the linear arrangement problem is established. It is shown that when the arboricity is close ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The bipartite crossing number problem is studied, and a connection between this problemand the linear arrangement problem is established. It is shown that when the arboricity is close
Rerouting requests in wdm networks
 In AlgoTel
, 2005
"... We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differences with two other known problems: the pathwidth and the pursuit problem. We then present a distributed lineartime algorithm to solve the problem on trees. Last we give the solutions fo ..."
Abstract

Cited by 17 (16 self)
 Add to MetaCart
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differences with two other known problems: the pathwidth and the pursuit problem. We then present a distributed lineartime algorithm to solve the problem on trees. Last we give the solutions for some classes of graphs, in particular complete dary trees and grids.