2314 search results - page 244 / 463 » Minimal Partitions of a Graph |
156
click to vote
DIAGRAMS
2004
Springer
15 years 10 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
134
click to vote
ACSC
2003
IEEE
15 years 9 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
127
click to vote
ISAAC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
145
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
143
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...