2314 search results - page 131 / 463 » Minimal Partitions of a Graph |
123
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
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...
127
Voted
DM
1999
15 years 3 months ago
1999
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 ...
167
Voted
WAW
2010
Springer
15 years 1 months ago
2010
Springer
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...
123
Voted
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
133
click to vote
GD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...