1172 search results - page 65 / 235 » Path Algorithms on Regular Graphs |
98
Voted
SAC
2004
ACM
15 years 5 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
94
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
WALCOM
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
130
Voted
PAMI
2011
14 years 3 months ago
2011
— This paper addresses how to model and correct image blur that arises when a camera undergoes ego motion while observing a distant scene. In particular, we discuss how the blurr...
114
click to vote
SIAMCOMP
2000
15 years 6 days ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...