Results 1  10
of
725
Visual Navigation of Compound Graphs
 In Proceedings of the 12th International Symposium on Graph Drawing (GD’04
, 2004
"... This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876892) for drawing views of compound graphs. A view is an abstract representation of a compound graph; it is generated by contracting subgraphs into meta ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876892) for drawing views of compound graphs. A view is an abstract representation of a compound graph; it is generated by contracting subgraphs
ON THE NUMBER OF PERFECT MATCHINGS OF COMPOUND GRAPHS
"... Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies of a planar bipartite base graph, and explore the number of perfect matchings of compound graphs. The main result is that the number of matchings of every compound graph is divisible by the number of ..."
Abstract
 Add to MetaCart
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies of a planar bipartite base graph, and explore the number of perfect matchings of compound graphs. The main result is that the number of matchings of every compound graph is divisible by the number
ON THE DISTANCE OF SOME COMPOUND GRAPHS
 UNIV. BEOGRAD. PUBL. ELEKTROTEHN. FAK. SER. MAT. 5 �1994�, 29�34.
, 1994
"... The distance d(G) of a connected graph G is the sum of the distances of all pairs of vertices of G: Let S be a connected graph. The sets In and Jn are defined so that I1 = J1 = fSg; and for n�1 the elements of In�Jn � are graphs obtained by identifying �joining � a vertex of S with a vertex of an el ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The distance d(G) of a connected graph G is the sum of the distances of all pairs of vertices of G: Let S be a connected graph. The sets In and Jn are defined so that I1 = J1 = fSg; and for n�1 the elements of In�Jn � are graphs obtained by identifying �joining � a vertex of S with a vertex
SPECTRA OF WEIGHTED COMPOUND GRAPHS OF
"... This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been accepted for inclusion in Electronic Journal of Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, please contact scholcom@uwyo.edu. ..."
Abstract
 Add to MetaCart
This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been accepted for inclusion in Electronic Journal of Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, please contact scholcom@uwyo.edu.
Drawings of Compound Graph Using Freeform Curves
"... Compound graph is a kind of graph representation that can represent both hierarchy and adjacency relationships. It integrates inclusion graph and ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Compound graph is a kind of graph representation that can represent both hierarchy and adjacency relationships. It integrates inclusion graph and
Applying Crossing Reduction Strategies to Layered Compound Graphs
 In Proc. Graph Drawing, GD 2002, volume 2528 of LNCS
, 2002
"... We present a new method for the application of 2layer crossing reduction algorithms to layered compound graphs. It is based on an algorithm by Sander and improves it with fewer crossings. Our method is optimal in the sense that it does not introduce unnecessary crossings by itself. If used with an ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a new method for the application of 2layer crossing reduction algorithms to layered compound graphs. It is based on an algorithm by Sander and improves it with fewer crossings. Our method is optimal in the sense that it does not introduce unnecessary crossings by itself. If used
TreeMatrix: A Hybrid Visualization of Compound Graphs
 COMPUTER GRAPHICS FORUM
, 2012
"... We present a hybrid visualization technique for compound graphs (i.e., networks with a hierarchical clustering defined on the nodes) that combines the use of adjacency matrices, nodelink and arc diagrams to show the graph, and also combines the use of nested inclusion and icicle diagrams to show th ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a hybrid visualization technique for compound graphs (i.e., networks with a hierarchical clustering defined on the nodes) that combines the use of adjacency matrices, nodelink and arc diagrams to show the graph, and also combines the use of nested inclusion and icicle diagrams to show
A Layout Algorithm for Undirected Compound Graphs
, 2008
"... We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional forcedirected layout scheme with extensions to handle multilevel nesting, edges between nodes of ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional forcedirected layout scheme with extensions to handle multilevel nesting, edges between nodes
A Repository of Compound Graphs for use in Large Network Design
, 2007
"... In a field of network design, engineers desire better ways to design efficient communication network. While designing such network, we are restricted with engineering constraints such as communication delays and hardware costs. Many construction techniques have been proposed. In this paper we focus ..."
Abstract
 Add to MetaCart
on compounding techniques and provide (∆,D) tables that contain the largest compound graphs for given degree ∆ and diameter D. We also empirically verify a few of the recently discovered large compound graphs. 1
SPECTRA OF WEIGHTED COMPOUND GRAPHS OF GENERALIZED BETHE TREES
, 2009
"... A generalized Bethe tree is a rooted tree in which vertices at the same distance from the root have the same degree. Let Gm be a connected weighted graph on m vertices. Let {Bi:1 ≤ i ≤ m} be a set of trees such that, for i =1, 2,...,m, (i) Bi is a generalized Bethe tree of ki levels, (ii) the verti ..."
Abstract
 Add to MetaCart
A generalized Bethe tree is a rooted tree in which vertices at the same distance from the root have the same degree. Let Gm be a connected weighted graph on m vertices. Let {Bi:1 ≤ i ≤ m} be a set of trees such that, for i =1, 2,...,m, (i) Bi is a generalized Bethe tree of ki levels, (ii
Results 1  10
of
725