1664 search results - page 27 / 333 » Distance labeling in graphs |
DAM
2008
14 years 12 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
108
click to vote
ICML
2008
IEEE
16 years 19 days ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
106
click to vote
RSA
2008
14 years 11 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
CPM
2008
Springer
15 years 1 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
117
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...