3958 search results - page 156 / 792 » Dynamic Graph Algorithms with Applications |
172
Voted
WEA
2007
Springer
16 years 14 days ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
167
Voted
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
163
click to vote
ALENEX
2004
15 years 7 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
190
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
274
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...