1605 search results - page 16 / 321 » On Partitional Labelings of Graphs |
150
Voted
IEICET
2011
14 years 9 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
151
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
114
click to vote
DM
2010
15 years 2 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
81
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
130
Voted
JCO
2007
15 years 2 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...