776 search results - page 2 / 156 » Network Applications of Graph Bisimulation |
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
NETWORKS
2000
13 years 5 months ago
2000
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
TKDE
2012
11 years 7 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...