Sciweavers

1664 search results - page 17 / 333
» Distance labeling in graphs
Sort
View
BIRTHDAY
2005
Springer
15 years 5 months ago
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
Hans Jürgen Schneider
JGT
2010
128views more  JGT 2010»
14 years 10 months ago
On antimagic directed graphs
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
Dan Hefetz, Torsten Mütze, Justus Schwartz
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
15 years 4 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
DM
2008
73views more  DM 2008»
14 years 12 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
PAMI
2010
396views more  PAMI 2010»
14 years 10 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu