3958 search results - page 75 / 792 » Dynamic Graph Algorithms with Applications |
142
click to vote
DSD
2003
IEEE
15 years 10 months ago
2003
IEEE
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
262
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
160
Voted
JSSPP
2005
Springer
15 years 10 months ago
2005
Springer
Real-time applications with security requirements are emerging in various areas including government, education, and business. The security sensitive real-time applications can ta...
129
click to vote
JPDC
2006
15 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
130
click to vote
IMCSIT
2010
15 years 2 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...