1162 search results - page 12 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
114
Voted
PATMOS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
140
Voted
SIAMSC
2008
15 years 3 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
137
Voted
ESA
1997
Springer
15 years 7 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
179
Voted
ANTSW
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
134
Voted
ENTCS
2006
15 years 3 months ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...