3958 search results - page 76 / 792 » Dynamic Graph Algorithms with Applications |
159
click to vote
TVCG
2008
15 years 4 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
147
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
162
click to vote
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
132
Voted
TALG
2008
15 years 4 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
122
click to vote
DM
2008
15 years 4 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...