1172 search results - page 72 / 235 » Path Algorithms on Regular Graphs |
80
Voted
INFORMATICALT
2006
15 years 13 days ago
2006
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...
104
Voted
ATMOS
2009
15 years 1 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
122
Voted
ISCC
1999
IEEE
15 years 4 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
113
click to vote
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...