1605 search results - page 82 / 321 » On Partitional Labelings of Graphs |
130
click to vote
ISMIR
2003
Springer
15 years 9 months ago
2003
Springer
A technique for harmonic analysis is presented that partitions a piece of music into contiguous regions and labels each with the key, mode, and functional chord, e.g. tonic, domin...
121
click to vote
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
117
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
131
click to vote
JCT
2008
15 years 3 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
114
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...