Sciweavers

1664 search results - page 19 / 333
» Distance labeling in graphs
Sort
View
FUIN
2006
90views more  FUIN 2006»
15 years 1 months ago
Local Computations in Graphs: The Case of Cellular Edge Local Computations
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Jérémie Chalopin, Yves Métivi...
91
Voted
INFORMATICALT
2006
104views more  INFORMATICALT 2006»
15 years 1 months ago
Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar Graphs
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
Auparajita Krishnaa, Manohar Singh Dulawat
IEICET
2011
14 years 8 months ago
Minimum Spanning Tree Problem with Label Selection
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...
Akio Fujiyoshi, Masakazu Suzuki
GBRPR
2007
Springer
15 years 8 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
101
Voted
EMNLP
2008
15 years 3 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...