3211 search results - page 217 / 643 » On the Grundy Number of a Graph |
178
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
164
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
134
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
212
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
190
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...