2314 search results - page 102 / 463 » Minimal Partitions of a Graph |
113
Voted
GD
2003
Springer
15 years 8 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
103
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
113
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
110
Voted
ASPDAC
1995
ACM
15 years 7 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
156
Voted
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...