Sciweavers

1605 search results - page 41 / 321
» On Partitional Labelings of Graphs
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Large Graph Construction for Scalable Semi-Supervised Learning
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
Wei Liu, Junfeng He, Shih-Fu Chang
DM
2002
102views more  DM 2002»
13 years 8 months ago
Totally magic graphs
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, ...
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 8 months ago
Using Determining Sets to Distinguish Kneser Graphs
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
Michael O. Albertson, Debra L. Boutin
COCOA
2008
Springer
13 years 9 months ago
Magic Labelings on Cycles and Wheels
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
Andrew Baker, Joe Sawada
SLIP
2003
ACM
14 years 1 months ago
Fast estimation of the partitioning rent characteristic using a recursive partitioning model
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
Joni Dambre, Dirk Stroobandt, Jan Van Campenhout