73 search results - page 7 / 15 » Labeling Schemes for Vertex Connectivity |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
ISCC
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we develop a Load Balancing scheme for networks based on the MPLS framework. The proposed algorithm (DYLBA - Dynamic Load Balancing Algorithm) implements a local sea...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
TOG
2002
13 years 7 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
ICALP
1998
Springer
14 years 1 days ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...