1162 search results - page 69 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
144
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
168
Voted
TKDE
2012
13 years 6 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
156
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
119
Voted
TSE
2010
15 years 2 months ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
149
click to vote
JCO
2006
15 years 3 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...