Sciweavers

1952 search results - page 120 / 391
» Complete partitions of graphs
Sort
View
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
15 years 4 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
153
Voted
JDA
2010
131views more  JDA 2010»
15 years 2 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 4 months ago
Layout of Graphs with Bounded Tree-Width
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 numb...
Vida Dujmovic, Pat Morin, David R. Wood
DM
1999
101views more  DM 1999»
15 years 4 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
15 years 2 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas