3958 search results - page 15 / 792 » Dynamic Graph Algorithms with Applications |
107
click to vote
WEA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
135
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
108
Voted
ICAS
2006
IEEE
15 years 8 months ago
2006
IEEE
— The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to ha...
96
Voted
CAIP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
114
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...