Sciweavers

659 search results - page 24 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica
INFOCOM
2010
IEEE
13 years 6 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
WEBI
2007
Springer
14 years 1 months ago
DENGRAPH: A Density-based Community Detection Algorithm
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
Tanja Falkowski, Anja Barth, Myra Spiliopoulou
ICST
2010
IEEE
13 years 5 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano